標(biāo)題: Titlebook: Approximation and Online Algorithms; 19th International W Jochen Koenemann,Britta Peis Conference proceedings 2021 Springer Nature Switzerl [打印本頁] 作者: 掩飾 時間: 2025-3-21 16:12
書目名稱Approximation and Online Algorithms影響因子(影響力)
書目名稱Approximation and Online Algorithms影響因子(影響力)學(xué)科排名
書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度
書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation and Online Algorithms被引頻次
書目名稱Approximation and Online Algorithms被引頻次學(xué)科排名
書目名稱Approximation and Online Algorithms年度引用
書目名稱Approximation and Online Algorithms年度引用學(xué)科排名
書目名稱Approximation and Online Algorithms讀者反饋
書目名稱Approximation and Online Algorithms讀者反饋學(xué)科排名
作者: Fester 時間: 2025-3-21 22:27 作者: Affirm 時間: 2025-3-22 00:42 作者: linguistics 時間: 2025-3-22 07:48 作者: GLIB 時間: 2025-3-22 12:00 作者: Rct393 時間: 2025-3-22 15:42
Die Entstehung der Herzhypertrophie, .). Our main contribution is a novel rounding scheme that allows us to round an (approximate) solution to the ‘continuous movement’ relaxation of the problem to a discrete one (incurring a bounded loss). Using our scheme, we derive constant-factor approximation algorithms on path and cycle graphs. 作者: evasive 時間: 2025-3-22 19:41
,über den kindlichen Kreislauf, packing, which is similar to the price of clustering, but there is a constant number of large clusters. We analyze the price of clustering for BPCC, including the parametric case with bounded item sizes. We discuss several greedy algorithms for this problem that were not studied in the past, and co作者: 裂口 時間: 2025-3-23 01:17
Das transitorische Cushing-Syndrom,me algorithm for jobs with resource demands higher than 0.5. We thus create a hybrid, constant approximation algorithm for two or more machines. We also develop a constant approximation algorithm for the case with a single machine. This research is the first, to the best of our knowledge, to propose作者: 倔強(qiáng)一點 時間: 2025-3-23 04:12 作者: Flawless 時間: 2025-3-23 05:37
,über die St?rungen der Stimme und Sprache,d to any desired accuracy. We also characterize the space of achievable allocations for any distribution, give algorithms for computing an optimum fair allocation for arbitrary distributions, and describe other natural fair CR schemes for product distributions. These results are based on matrix scal作者: Osmosis 時間: 2025-3-23 12:28
0302-9743 ok were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems..978-3-030-92701-1978-3-030-92702-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使痛苦 時間: 2025-3-23 15:32 作者: adroit 時間: 2025-3-23 21:11 作者: 協(xié)定 時間: 2025-3-23 23:47
Die Entstehung der Herzhypertrophie, in the most general cases 8/3 is the best approximation ratio known attainable in polynomial time?[.]. Our algorithms are designed based on the most natural LP relaxation of .-EDS and maximal .-matchings (or its generalization).作者: 擁擠前 時間: 2025-3-24 03:29 作者: 熟練 時間: 2025-3-24 06:33 作者: 思考才皺眉 時間: 2025-3-24 11:08 作者: 銼屑 時間: 2025-3-24 17:24
Server Cloud Scheduling,lly, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS with respect for the makespan objective for a fairly general case and strong hardness for the case with unit processing times and delays.作者: cipher 時間: 2025-3-24 19:27 作者: 褻瀆 時間: 2025-3-25 00:02
,Precedence-Constrained Covering Problems with?Multiplicity Constraints,yield an .-approximation, where . is the maximum number of variables with nonzero coefficients in a covering constraint. This is nearly-optimal under standard complexity-theoretic assumptions and surprisingly matches the bound achieved for the problem without precedence constraints.作者: hangdog 時間: 2025-3-25 03:44 作者: COW 時間: 2025-3-25 08:38
,Constant Factor Approximation for?Tracking Paths and?Fault Tolerant Feedback Vertex Set,ation of the closely related . . problem. There, for a fixed integer?. and a given vertex-weighted graph ., the task is to find a minimum weight set of vertices intersecting every cycle of?. in at least?. vertices. We give a factor . approximation algorithm for . . if . is a constant.作者: Urologist 時間: 2025-3-25 11:55
,On ,-Matchings and?,-Edge Dominating Sets: A?2-Approximation Algorithm for?the?4-Edge Dominating Se in the most general cases 8/3 is the best approximation ratio known attainable in polynomial time?[.]. Our algorithms are designed based on the most natural LP relaxation of .-EDS and maximal .-matchings (or its generalization).作者: 自作多情 時間: 2025-3-25 17:32 作者: generic 時間: 2025-3-25 23:36
L. Heilmeyer,A. Schittenhelm,B. Rudderm of the vector of loads of the machines. We present an EPTAS for this problem. Prior to our work only a PTAS was known in this non-renewable resource settings and this PTAS was only for the special case of our problem of makespan minimization on identical machines.作者: 遺傳 時間: 2025-3-26 00:52
F. Kraus,O. Minkowski,A. Schittenhelm significantly improves over the previously best known competitive ratio of . and surpasses the current best .-competitive algorithm for the integral case. Moreover, our algorithm is deterministic in contrast to the randomized algorithms achieving the results mentioned above.作者: Freeze 時間: 2025-3-26 06:30 作者: 表示向前 時間: 2025-3-26 11:44
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource,m of the vector of loads of the machines. We present an EPTAS for this problem. Prior to our work only a PTAS was known in this non-renewable resource settings and this PTAS was only for the special case of our problem of makespan minimization on identical machines.作者: amplitude 時間: 2025-3-26 13:12 作者: Expostulate 時間: 2025-3-26 20:20 作者: Lacunar-Stroke 時間: 2025-3-27 00:21 作者: 沙漠 時間: 2025-3-27 02:32 作者: 跑過 時間: 2025-3-27 07:03
,Tight Inapproximability of?Minimum Maximal Matching on?Bipartite Graphs and?Related Problems, holds for computationally equivalent .. Our lower bound matches the approximation provided by a trivial algorithm..Our results imply conditional hardness of approximating Maximum Stable Matching with Ties and Incomplete Lists with a constant better than ., which also matches the best known approximation algorithm.作者: 新手 時間: 2025-3-27 12:41 作者: hair-bulb 時間: 2025-3-27 16:22
,Constant Factor Approximation for?Tracking Paths and?Fault Tolerant Feedback Vertex Set,rackers in each path from . to . is unique. In this work, we derive a factor 66-approximation algorithm for . in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approxim作者: forebear 時間: 2025-3-27 20:27 作者: Feigned 時間: 2025-3-28 00:47
,Tight Inapproximability of?Minimum Maximal Matching on?Bipartite Graphs and?Related Problems,oximate with any constant smaller than 2 even in bipartite graphs, assuming either of two stronger variants of Unique Games Conjecture. The bound also holds for computationally equivalent .. Our lower bound matches the approximation provided by a trivial algorithm..Our results imply conditional hard作者: 領(lǐng)先 時間: 2025-3-28 04:59 作者: 逃避責(zé)任 時間: 2025-3-28 10:12
The Traveling ,-Median Problem: Approximating Optimal Network Coverage,orizon of . steps. The agents start and end at designated nodes, and in each step can hop to an adjacent node to improve coverage. At each time step, we evaluate the coverage cost as the total connection cost of each node to its closest median. Our goal is to minimize the sum of the coverage costs o作者: Decongestant 時間: 2025-3-28 14:26
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource, on parallel uniformly related machines. The input defines the speed of machines, size of jobs, the quantity of resource required by the jobs, the replenished quantities, and replenishment dates of the resource. Every job can start processing only after the required quantity of the resource is alloc作者: 幾何學(xué)家 時間: 2025-3-28 16:13
Several Methods of Analysis for Cardinality Constrained Bin Packing,?1] are to be packed into bins, such that no bin has more than . items or total size larger than 1. The goal is to minimize the number of bins..A recently introduced concept, called the price of clustering, deals with inputs that are presented in a way that they are split into clusters. Thus, an ite作者: 酷熱 時間: 2025-3-28 19:16
,Weighted Completion Time Minimization for?Capacitated Parallel Machines,ing environments. We study settings in which the processed jobs may have varying duration, resource requirements and importance (weight). Each server (machine) can process multiple concurrent jobs up?to its capacity. Due to the problem’s .-hardness, we study heuristic approaches with provable approx作者: entitle 時間: 2025-3-29 02:57 作者: 嚴(yán)厲批評 時間: 2025-3-29 04:51
,FIFO and?Randomized Competitive Packet Routing Games,r arrival time, which depends on one hand on the transit times of the edges and on the other hand on the suffered waiting times. These occur whenever several packets try to enter an edge simultaneously. In those situations, scheduling policies determine which packet is allowed to enter this edge fir作者: 俗艷 時間: 2025-3-29 07:38
Improved Online Algorithm for Fractional Knapsack in the Random Order Model,er, the corresponding online setting has been handled only briefly in the theoretical computer science literature so far, although it appears in several applications. Even the previously best known guarantee for the competitive ratio was worse than the best known for the integral problem in the popu作者: extemporaneous 時間: 2025-3-29 15:21
,Fractionally Subadditive Maximization Under an?Incremental Knapsack Constraint,o this problem is given by an order in which to include the elements of the ground set, and the competitive ratio of an incremental solution is defined by the worst ratio over all capacities relative to an optimum solution of the corresponding capacity. We present an algorithm that finds an incremen作者: Hemoptysis 時間: 2025-3-29 17:57 作者: 陰郁 時間: 2025-3-29 20:15
,Precedence-Constrained Covering Problems with?Multiplicity Constraints,al order. We examine the general case with multiplicity constraints, where item . can be chosen up to . times. For the basic Precedence-Constrained Knapsack problem (PCKP) we answer an open question of McCormick et al. [.] and show the existence of approximation algorithms with strongly-polynomial b作者: INCUR 時間: 2025-3-30 01:30 作者: 混合物 時間: 2025-3-30 05:17
https://doi.org/10.1007/978-3-030-92702-8Computer Science; Informatics; Conference Proceedings; Research; Applications作者: Exaggerate 時間: 2025-3-30 10:41
978-3-030-92701-1Springer Nature Switzerland AG 2021作者: ALE 時間: 2025-3-30 14:00 作者: 象形文字 時間: 2025-3-30 19:38
Blut und vegetative Regulation,rackers in each path from . to . is unique. In this work, we derive a factor 66-approximation algorithm for . in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approxim作者: Ballad 時間: 2025-3-30 20:58
Die Entwicklung der klinischen Thermometrie,most one more than the arboricity of our graph via a primal-dual algorithm. This is nearly the best approximation possible, as Bansal and Umboh have shown it is NP-hard to approximate dominating sets to within one less than the arboricity of the graph.作者: Breach 時間: 2025-3-31 04:30 作者: 暫時中止 時間: 2025-3-31 08:14
Die Entstehung der Herzhypertrophie,ven graph . with a demand vector . such that each edge . is dominated by . edges of .. When a solution . is not allowed to be a multi-set, it is called . .-EDS. We present a 2-approximation algorithm for simple .-EDS for the case of .. The 2-approximation on general graphs has been known when ., and作者: 面包屑 時間: 2025-3-31 09:43
Die Entstehung der Herzhypertrophie,orizon of . steps. The agents start and end at designated nodes, and in each step can hop to an adjacent node to improve coverage. At each time step, we evaluate the coverage cost as the total connection cost of each node to its closest median. Our goal is to minimize the sum of the coverage costs o
