標題: Titlebook: Approximation and Online Algorithms; 10th International W Thomas Erlebach,Giuseppe Persiano Conference proceedings 2013 Springer-Verlag Ber [打印本頁] 作者: HBA1C 時間: 2025-3-21 17:03
書目名稱Approximation and Online Algorithms影響因子(影響力)
書目名稱Approximation and Online Algorithms影響因子(影響力)學科排名
書目名稱Approximation and Online Algorithms網(wǎng)絡公開度
書目名稱Approximation and Online Algorithms網(wǎng)絡公開度學科排名
書目名稱Approximation and Online Algorithms被引頻次
書目名稱Approximation and Online Algorithms被引頻次學科排名
書目名稱Approximation and Online Algorithms年度引用
書目名稱Approximation and Online Algorithms年度引用學科排名
書目名稱Approximation and Online Algorithms讀者反饋
書目名稱Approximation and Online Algorithms讀者反饋學科排名
作者: chlorosis 時間: 2025-3-21 22:18
Independent Set with Advice: The Impact of Graph Knowledgehe size of the advice needed to solve the problem efficiently. On one hand, we show that, for sparse graphs, constant-size advice is sufficient to solve the maximum independent set problem with constant competitive ratio, even with no knowledge of the underlying graph. On the other hand, we show a l作者: Palate 時間: 2025-3-22 01:23
Online Multi-Commodity Flow with High Demands than the edge capacities of the network..We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor..The algorithm can handle two types of flow作者: Palpate 時間: 2025-3-22 07:41 作者: 心胸開闊 時間: 2025-3-22 12:08 作者: 男生戴手銬 時間: 2025-3-22 13:18 作者: Expiration 時間: 2025-3-22 18:43
Probabilistic ,-Median Clustering in Data Streamsn problem in the metric and Euclidean case. The coresets are of size poly(..,.,log(./(.. ·.. ·.))), where . is the expected total weight of the weighted probabilistic input points, .. is the minimum weight of a probabilistic input point, .. is the minimum realization probability, and . is the error 作者: PLUMP 時間: 2025-3-22 23:29
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphslication in wireless ad-hoc networks. Since the minimum dominating set problem for unit disk graphs is NP-hard, several approximation algorithms with different merits have been proposed in the literature. On one extreme, there is a linear time 5-approximation algorithm. On another extreme, there are作者: Valves 時間: 2025-3-23 01:57
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoodss in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree 作者: 擁擠前 時間: 2025-3-23 05:52 作者: MOAN 時間: 2025-3-23 12:41 作者: overhaul 時間: 2025-3-23 14:32
Minimizing Cache Usage in Pagingy applications this resource is shared or its usage involves a cost. In this work we introduce the Minimum Cache Usage problem, which is an extension to the classic paging problem that accounts for the efficient use of cache resources by paging algorithms. In this problem, the cost of a paging algor作者: 易碎 時間: 2025-3-23 19:14
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems to the best possible competitive ratio for a given online problem. In this paper we continue this line of research by addressing several makespan scheduling problems and introducing new ideas: we combine the classical technique of structuring and simplifying the input instance for approximation sch作者: 我不明白 時間: 2025-3-24 00:55 作者: seruting 時間: 2025-3-24 04:31 作者: reperfusion 時間: 2025-3-24 07:36
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games With respect to traditional combinatorial approaches, the primal-dual schema has at least three advantages: first, it provides an analytic tool which can always be used to prove tight upper bounds for all the cases in which we are able to characterize exactly the polyhedron of the solutions under a作者: DECRY 時間: 2025-3-24 12:30 作者: Prologue 時間: 2025-3-24 17:59 作者: 纖細 時間: 2025-3-24 21:19
Springer Tracts in Modern Physicsed probabilistic input points, .. is the minimum weight of a probabilistic input point, .. is the minimum realization probability, and . is the error probability of the construction. We show how to maintain our coreset for Euclidean spaces in data streams.作者: Triglyceride 時間: 2025-3-25 03:07 作者: gait-cycle 時間: 2025-3-25 03:56
Probabilistic ,-Median Clustering in Data Streamsed probabilistic input points, .. is the minimum weight of a probabilistic input point, .. is the minimum realization probability, and . is the error probability of the construction. We show how to maintain our coreset for Euclidean spaces in data streams.作者: 重畫只能放棄 時間: 2025-3-25 09:35
Black and White Bin Packingform very well — and for all online algorithms we also prove the universal . bound . which significantly exceeds the known . bound 1.58889 on classical online bin packing. We also design an online algorithm which is 3-competitive in the absolute sense. A 2.5-approximation algorithm and an APTAS is also given for the offline version.作者: corporate 時間: 2025-3-25 13:55
Conference proceedings 2013vited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.作者: 謙卑 時間: 2025-3-25 17:02
,Erzeugung und Anwendung von R?ntgenblitzen,ower bound of Ω(log(./.)/loglog(./.)) on the competitive ratio of finding a maximum independent set in bipartite graphs if no knowledge of the underlying graph is available and if the advice is of size .. We complement the lower bounds by providing corresponding upper bounds.作者: aplomb 時間: 2025-3-25 23:25 作者: 變量 時間: 2025-3-26 03:20
O. Haxel,J. H. D. Jensen,H. E. Suesswith neighborhoods (.) problem, and the maximum weight version (.) has not been studied previously to our knowledge. We provide deterministic and parameterized approximation algorithms for the . problem, and a parameterized algorithm for the . problem. Additionally, we present hardness of approximation proofs for both settings.作者: 擦試不掉 時間: 2025-3-26 06:03
Ergebnisse der Exakten Naturwissenschaftene first prove a . factor, where . depends on a partition of the jobs according to their heat contributions. Next, we refine our partition and provide a linear program that shows a lower bound of 0.72 on the approximation factor.作者: enumaerate 時間: 2025-3-26 12:31 作者: NIB 時間: 2025-3-26 13:52
https://doi.org/10.1007/978-3-642-94299-0olynomial algorithms for fixed parameter values, as well as several . results. The parameters under consideration are the treewidth of the input graph, the sizes . and . and the vertex load, i.e. the maximum number of paths passing through any vertex.作者: 農(nóng)學 時間: 2025-3-26 20:32 作者: 滑稽 時間: 2025-3-26 22:26 作者: nonplus 時間: 2025-3-27 02:40
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parametersolynomial algorithms for fixed parameter values, as well as several . results. The parameters under consideration are the treewidth of the input graph, the sizes . and . and the vertex load, i.e. the maximum number of paths passing through any vertex.作者: nascent 時間: 2025-3-27 05:19
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problemsa near optimal on-line algorithm. We demonstrate how this technique can be successfully applied to three basic makespan online over time scheduling problems: scheduling on unrelated parallel machines, job shop scheduling and single machine scheduling with delivery times.作者: innovation 時間: 2025-3-27 12:08
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scalings. This analysis shows that competitive algorithms exist for problems that had resisted analysis using the dominant potential function approach in the speed-scaling literature, and provides alternate cleaner analysis for other known results. This gives us another tool in the design and analysis of primal-dual algorithms for online problems.作者: Clinch 時間: 2025-3-27 15:57 作者: 預測 時間: 2025-3-27 21:01
Online Multi-Commodity Flow with High Demands requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow..Two extensions are discussed: requests with known durations and machine scheduling.作者: 拖網(wǎng) 時間: 2025-3-28 00:31 作者: 大約冬季 時間: 2025-3-28 05:12
Approximating the Throughput by Coolest First Schedulinge first prove a . factor, where . depends on a partition of the jobs according to their heat contributions. Next, we refine our partition and provide a linear program that shows a lower bound of 0.72 on the approximation factor.作者: Galactogogue 時間: 2025-3-28 07:31
0302-9743 sions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.978-3-642-38015-0978-3-642-38016-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 構想 時間: 2025-3-28 13:47
Springer Tracts in Modern Physicsaging and the randomized k-server problem [2,1]. Finally, we will also see some recent extensions of the method [3,6,5], beyond the original framework of Buchbinder and Naor [4]..Based on joint works with Niv Buchbinder, Aleksander Madry and Joseph (Seffi) Naor.作者: Urgency 時間: 2025-3-28 18:19
Ergebnisse der Ultrarotforschung,with degree at most two. While the optimal solutions (and the practical applications) of both formulations coincide, our formulation proves more suitable for approximation. In fact, it admits a trivial 1/2-approximation algorithm. Our main contribution is a local search algorithm that guarantees a ratio of?6/11.作者: Graduated 時間: 2025-3-28 19:25
The Primal-Dual Approach for Online Algorithmsaging and the randomized k-server problem [2,1]. Finally, we will also see some recent extensions of the method [3,6,5], beyond the original framework of Buchbinder and Naor [4]..Based on joint works with Niv Buchbinder, Aleksander Madry and Joseph (Seffi) Naor.作者: BOOM 時間: 2025-3-29 00:31 作者: 調整校對 時間: 2025-3-29 06:03 作者: Ligament 時間: 2025-3-29 10:02 作者: sed-rate 時間: 2025-3-29 13:40 作者: daredevil 時間: 2025-3-29 17:10 作者: 上漲 時間: 2025-3-29 20:41
https://doi.org/10.1007/978-3-642-94299-0irs of terminals in .. We investigate two variations: one in which we are given a routing . of the requests in ., and one in which we are required to find also the routing. In both cases, each path in . must contain a regenerator after every . edges in order to deal with loss of signal quality for s作者: Institution 時間: 2025-3-30 03:51 作者: CRP743 時間: 2025-3-30 06:52
Springer Tracts in Modern Physicsn problem in the metric and Euclidean case. The coresets are of size poly(..,.,log(./(.. ·.. ·.))), where . is the expected total weight of the weighted probabilistic input points, .. is the minimum weight of a probabilistic input point, .. is the minimum realization probability, and . is the error 作者: Generalize 時間: 2025-3-30 09:42 作者: WAG 時間: 2025-3-30 13:01
O. Haxel,J. H. D. Jensen,H. E. Suesss in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree 作者: 昏迷狀態(tài) 時間: 2025-3-30 18:55
