<p><p>This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018.<br> The 19 revised full papers presented together with one invited paper
Approximation and Online Algorithms: 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25โ26, 2016, Revised Selected Papers
โ Scribed by Klaus Jansen, Monaldo Mastrolilli (eds.)
- Publisher
- Springer International Publishing
- Year
- 2017
- Tongue
- English
- Leaves
- 223
- Series
- Lecture Notes in Computer Science 10138
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016.
The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: coloring and partitioning, 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.
โฆ Table of Contents
Front Matter....Pages I-XIV
The Shortest Separating Cycle Problem....Pages 1-13
Dynamic Traveling Repair Problem with an Arbitrary Time Window....Pages 14-26
A PTAS for the Cluster Editing Problem on Planar Graphs....Pages 27-39
Bin Packing with Colocations....Pages 40-51
Batch Coloring of Graphs....Pages 52-64
New Integrality Gap Results for the Firefighters Problem on Trees....Pages 65-77
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs....Pages 78-91
Balanced Optimization with Vector Costs....Pages 92-102
Vertex Sparsification in Trees....Pages 103-115
Scenario Submodular Cover....Pages 116-128
Non-greedy Online Steiner Trees on Outerplanar Graphs....Pages 129-141
A Refined Analysis of Online Path Coloring in Trees....Pages 142-154
Resource Allocation Games with Multiple Resource Classes....Pages 155-169
Tight Approximation Bounds for the Seminar Assignment Problem....Pages 170-182
A priori TSP in the Scenario Model....Pages 183-196
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems....Pages 197-209
Back Matter....Pages 211-211
โฆ Subjects
Algorithm Analysis and Problem Complexity;Discrete Mathematics in Computer Science;Data Structures;Algorithms;Numeric Computing
๐ SIMILAR VOLUMES
<p>This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event. The 22 revised full papers presented together wit
This book constitutes the thoroughly refereed post-conference proceedings of the Second International Workshop on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2016, held in Aarhus, Denmark, in August 2016. The 11 revised full papers presented together with one tutorial paper were carefully revi
This book constitutes the thoroughly refereed post-conference proceedings of the Second International Workshop on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2016, held in Aarhus, Denmark, in August 2016. The 11 revised full papers presented together with one tutorial paper were carefully revi
<P>This book constitutes the thoroughly refereed post proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event.</P> <P>The 26 revised full papers presented were carefully