Del 10138 i serien Lecture Notes in Computer Science

Approximation and Online Algorithms

14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers

Häftad, Engelska, 2017

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2017-01-07
Mått155 x 235 x 13 mm
Vikt353 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor211
FörlagSpringer International Publishing AG
ISBN9783319517407

Tillhör följande kategorier

Approximation Algorithms for the k-Set Packing Problem.- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization.- The Shortest Separating Cycle Problem.- Dynamic Traveling Repair Problem with an Arbitrary Time Window.- A PTAS for the Cluster Editing Problem on Planar Graphs.- Bin Packing with Colocations.- Batch Coloring of Graphs.- New Integrality Gap Results for the Firefighters Problem on Trees.- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs.- Balanced Optimization with Vector Costs.- Vertex Sparsification in Trees.- Scenario Submodular Cover.- Non-Greedy Online Steiner Trees on Outerplanar Graphs.- A Refined Analysis of Online Path Coloring in Trees.- Resource Allocation Games with Multiple Resource Classes.- Tight Approximation Bounds for the Seminar Assignment Problem.- A Priori TSP in the Scenario Model.- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems.