Approximation and Online Algorithms: 14th International Workshop, WAOA 2016, Aarhus, Denmark, August

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.