標(biāo)題: Titlebook: Approximation and Online Algorithms; 14th International W Klaus Jansen,Monaldo Mastrolilli Conference proceedings 2017 Springer Internation [打印本頁] 作者: 斷頭臺 時間: 2025-3-21 18:51
書目名稱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é)科排名
作者: 摘要 時間: 2025-3-21 21:50
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160427.jpg作者: 絆住 時間: 2025-3-22 03:50
https://doi.org/10.1007/978-3-319-51741-4balanced optimization; computational complexity; online algorithms; probability; robust optimization; alg作者: 自愛 時間: 2025-3-22 08:37 作者: 漫步 時間: 2025-3-22 10:18 作者: Afflict 時間: 2025-3-22 13:47 作者: 吸引力 時間: 2025-3-22 19:24
Neuere Ergebnisse der Diabetesbehandlung,or service at nodes in a metric space and a time window for each request. The goal is to maximize the number of requests served during their time window. The time to traverse between two points is equal to the distance. Serving a request requires unit time. Irani et al., SODA 2002 considered the spe作者: Lumbar-Spine 時間: 2025-3-22 23:45
https://doi.org/10.1007/978-3-642-94840-4of disjoint cliques. The cluster editing problem is closely related to correlation clustering and has applications, e.g. in image segmentation. For general graphs this problem is .-hard. In this paper we present an efficient polynomial time approximation scheme for the cluster editing problem on gra作者: 狼群 時間: 2025-3-23 05:14 作者: 機械 時間: 2025-3-23 08:13
Gewebsmastzellen und Mastzellen-Reticulose, the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input vertices. In the offline variant, the entire graph is presented at once, and in online problems, o作者: 罐里有戒指 時間: 2025-3-23 12:35 作者: exostosis 時間: 2025-3-23 16:47 作者: PHAG 時間: 2025-3-23 18:04
Die Finsenbehandlung bei Pocken,asible subset that minimizes the spread (or imbalance) of values in every coordinate of the underlying vector costs..We investigate the complexity and approximability of balanced optimization problems in a fairly general setting. We identify a large family of problems that admit a 2-approximation in作者: 小故事 時間: 2025-3-23 23:37 作者: 多余 時間: 2025-3-24 05:45
F. Kraus,O. Minkowski,A. Schittenhelmirical joint probability distribution, given as input by a weighted sample of realizations. The problem is a counterpart to the Stochastic Submodular Cover problem studied by Golovin and Krause?[.], which assumes independent variables. We give two approximation algorithms for Scenario Submodular Cov作者: 拾落穗 時間: 2025-3-24 06:40 作者: Noctambulant 時間: 2025-3-24 13:11 作者: Condescending 時間: 2025-3-24 15:21
Die Ausbrecherform des Bronchuskrebsesa MoD server. A server provides both storage and broadcasting needs. Accordingly, the user’s cost function encompasses both positive and negative congestion effects..A system in our model consists of . identical servers and . users. Each user is associated with a type (class) and should be serviced 作者: connoisseur 時間: 2025-3-24 22:28
Nicotins?uremangel und die Pellagrafrageh bin is restricted to an arbitrary set of values. The problem has been shown to be NP-complete and to not admit a PTAS. However, the only constant factor approximation algorithm known to date is randomized and it is not guaranteed to always produce a feasible solution..In this paper we show that a 作者: 星星 時間: 2025-3-25 02:31 作者: Postulate 時間: 2025-3-25 05:16
https://doi.org/10.1007/978-3-642-90692-3re generalizations of the well-studied metric uncapacitated facility location problem, taking uncertainties in demand values and costs into account. The proposed nested local search procedure uses three facility operations: adding, dropping, and swapping. To the best of our knowledge, this is the fi作者: 青春期 時間: 2025-3-25 08:11 作者: 法律的瑕疵 時間: 2025-3-25 14:44
https://doi.org/10.1007/978-3-642-94840-4neral graphs this problem is .-hard. In this paper we present an efficient polynomial time approximation scheme for the cluster editing problem on graphs embeddable in the plane with a few edge crossings. The running time of the algorithm is . for planar graphs and . for planar graphs with at most . crossings.作者: 逢迎白雪 時間: 2025-3-25 17:57
F. Kraus,O. Minkowski,A. Schittenhelmgraphs. First, we show how to obtain a 2-quality flow sparsifier with . for such graphs. We then consider the other extreme and construct exact sparsifiers of size ., when the input graph is unweighted.作者: GEAR 時間: 2025-3-25 22:04 作者: decipher 時間: 2025-3-26 03:03 作者: 徹底明白 時間: 2025-3-26 05:08
Vertex Sparsification in Trees,graphs. First, we show how to obtain a 2-quality flow sparsifier with . for such graphs. We then consider the other extreme and construct exact sparsifiers of size ., when the input graph is unweighted.作者: 收集 時間: 2025-3-26 09:55 作者: Tracheotomy 時間: 2025-3-26 14:53
F. Kraus,O. Minkowski,A. Schittenhelm building on previous related work (in?[., ., .]) and by exploiting a technique we call the Scenario-OR modification. We apply these algorithms to a new problem, Scenario Boolean Function Evaluation. Our results have applciations to other problems involving distributions that are explicitly specified by their support.作者: mastoid-bone 時間: 2025-3-26 17:35
https://doi.org/10.1007/978-3-642-90625-1 than the distance between them. The algorithm can be applied to a 21.752-competitive file allocation algorithm against adaptive online adversaries on outerplanar graphs. We also present a lower bound of 4 for arbitrary deterministic online Steiner tree algorithms on outerplanar graphs.作者: 眨眼 時間: 2025-3-26 23:01
https://doi.org/10.1007/978-3-642-90692-3for both connection types in the setting of two-stage stochastic optimization. Our algorithms admit order-preserving metrics and thus significantly generalize and improve the allowed mutability of the metric in comparison to previous algorithms, which only allow scenario-dependent inflation factors.作者: 僵硬 時間: 2025-3-27 02:15 作者: Horizon 時間: 2025-3-27 06:28 作者: 公社 時間: 2025-3-27 13:21
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems,for both connection types in the setting of two-stage stochastic optimization. Our algorithms admit order-preserving metrics and thus significantly generalize and improve the allowed mutability of the metric in comparison to previous algorithms, which only allow scenario-dependent inflation factors.作者: dialect 時間: 2025-3-27 14:42
https://doi.org/10.1007/978-3-642-90681-7orizontal or vertical pairs or constant length pairs on points laying on a grid. For pairs with no restriction we have an .-approximation algorithm and an .-approximation algorithm for the shortest separating planar graph.作者: manifestation 時間: 2025-3-27 18:55
,Zentralnervensystem und pernizi?se An?mie, sub-class of Second-Order Cone Programming. We show how to extend the multiplicative weights update method to derive approximation schemes for the above packing and covering problems. When the sets . are simple, such as ellipsoids or boxes, this yields substantial improvements in the running time over general convex programming solvers.作者: 危險 時間: 2025-3-28 00:54
https://doi.org/10.1007/978-3-642-90692-3sts a constant-factor approximation algorithm in three restricted cases: if the number of scenarios is fixed, if the number of missing vertices per scenario is bounded by a constant, and if the scenarios are nested. Finally, we discuss an elegant relation with an . minimum spanning tree problem.作者: Influx 時間: 2025-3-28 04:37 作者: Externalize 時間: 2025-3-28 06:17
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs, sub-class of Second-Order Cone Programming. We show how to extend the multiplicative weights update method to derive approximation schemes for the above packing and covering problems. When the sets . are simple, such as ellipsoids or boxes, this yields substantial improvements in the running time over general convex programming solvers.作者: 縱火 時間: 2025-3-28 11:19 作者: Absenteeism 時間: 2025-3-28 18:33 作者: Tailor 時間: 2025-3-28 20:01
Die Finsenbehandlung bei Pocken, polynomial time, and we show that for many problems in this family this approximation factor 2 is best-possible (unless P?=?NP). Special attention is paid to the balanced assignment problem with vector costs, which is shown to be NP-hard even in the highly restricted case of sum costs.作者: 喪失 時間: 2025-3-29 02:22
https://doi.org/10.1007/978-3-642-90625-1hierarchical partitioning, to show a lower bound of . for each tree . on the competitive ratio of any deterministic online algorithm for the problem. This gives us an insight into online coloring of paths on . tree ., whereas the current tight lower bound results are known only for special trees like paths and complete binary trees.作者: accrete 時間: 2025-3-29 06:04 作者: dagger 時間: 2025-3-29 10:28
Balanced Optimization with Vector Costs, polynomial time, and we show that for many problems in this family this approximation factor 2 is best-possible (unless P?=?NP). Special attention is paid to the balanced assignment problem with vector costs, which is shown to be NP-hard even in the highly restricted case of sum costs.作者: induct 時間: 2025-3-29 15:18
A Refined Analysis of Online Path Coloring in Trees,hierarchical partitioning, to show a lower bound of . for each tree . on the competitive ratio of any deterministic online algorithm for the problem. This gives us an insight into online coloring of paths on . tree ., whereas the current tight lower bound results are known only for special trees like paths and complete binary trees.作者: 使閉塞 時間: 2025-3-29 17:40
0302-9743 tioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real world applications, and scheduling problems..978-3-319-51740-7978-3-319-51741-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: dry-eye 時間: 2025-3-29 19:47
Dynamic Traveling Repair Problem with an Arbitrary Time Window,ddition, we characterize the rate of convergence of the competitive ratio, which approaches 1, as the laxity increases. Specifically, we provide matching lower and upper bounds. These bounds depend on the ratio between the laxity and the optimal TSP solution of the metric space (the minimum distance作者: PRISE 時間: 2025-3-30 00:28
Bin Packing with Colocations,on algorithms for particular families of graphs, including: a .-approximation algorithm for complete graphs (improving a previous ratio of 8), a 2-approximation algorithm for paths, a 5-approximation algorithm for trees, and an .-approximation algorithm for unweighted trees. For general graphs, we p作者: 澄清 時間: 2025-3-30 07:11 作者: RAGE 時間: 2025-3-30 08:40
New Integrality Gap Results for the Firefighters Problem on Trees,tions for the firefighter problem. We first show a matching lower bound of . on the integrality gap of the canonical LP. This result relies on a powerful . that can be used to derive integrality gap results in other related settings. Next, we consider the canonical LP augmented with simple additiona作者: Inscrutable 時間: 2025-3-30 14:16 作者: Congestion 時間: 2025-3-30 19:07 作者: 媽媽不開心 時間: 2025-3-31 00:27 作者: 護身符 時間: 2025-3-31 02:45
Gewebsmastzellen und Mastzellen-Reticulose,f the online and offline models. We provide several results, including a general result for sum coloring and results for the classic graph coloring problem on restricted graph classes: We show tight bounds for any graph class containing trees as a subclass (e.g., forests, bipartite graphs, planar gr作者: 真實的人 時間: 2025-3-31 07:30 作者: HERE 時間: 2025-3-31 09:33 作者: 陳腐思想 時間: 2025-3-31 17:03 作者: 忍耐 時間: 2025-3-31 20:04
Dynamic Traveling Repair Problem with an Arbitrary Time Window,or service at nodes in a metric space and a time window for each request. The goal is to maximize the number of requests served during their time window. The time to traverse between two points is equal to the distance. Serving a request requires unit time. Irani et al., SODA 2002 considered the spe作者: 音的強弱 時間: 2025-4-1 00:46
A PTAS for the Cluster Editing Problem on Planar Graphs,of disjoint cliques. The cluster editing problem is closely related to correlation clustering and has applications, e.g. in image segmentation. For general graphs this problem is .-hard. In this paper we present an efficient polynomial time approximation scheme for the cluster editing problem on gra
