TY  - BOOK
AU  - Bampis,Evripidis
AU  - Svensson,Ola
TI  - Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers 
SN  - 9783319182636
PY  - 2015///
CY  - Cham
PB  - Springer International Publishing
KW  - Computer science
KW  - Algorithms
KW  - Numerical analysis
KW  - Mathematics
N1  - Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems
UR  - http://dx.doi.org/10.1007/978-3-319-18263-6
ER  -