Titlebook: Approximation and Online Algorithms; 10th International W Thomas Erlebach,Giuseppe Persiano Conference proceedings 2013 Springer-Verlag Ber

滑稽

nonplus

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

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

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

預(yù)測(cè)

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)

大約冬季

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

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

構(gòu)想

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.