WAOA B

17 papers

YearTitle / Authors
2017Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers
Klaus Jansen, Monaldo Mastrolilli
2016A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs.
Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy
2016A PTAS for the Cluster Editing Problem on Planar Graphs.
André Berger, Alexander Grigoriev, Andrej Winokurow
2016A Refined Analysis of Online Path Coloring in Trees.
Astha Chauhan, N. S. Narayanaswamy
2016A priori TSP in the Scenario Model.
Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters
2016Balanced Optimization with Vector Costs.
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2016Batch Coloring of Graphs.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016Bin Packing with Colocations.
Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos
2016Dynamic Traveling Repair Problem with an Arbitrary Time Window.
Yossi Azar, Adi Vardi
2016Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems.
Felix J. L. Willamowski, Andreas Bley
2016New Integrality Gap Results for the Firefighters Problem on Trees.
Parinya Chalermsook, Daniel Vaz
2016Non-greedy Online Steiner Trees on Outerplanar Graphs.
Akira Matsubayashi
2016Resource Allocation Games with Multiple Resource Classes.
Roy B. Ofer, Tami Tamir
2016Scenario Submodular Cover.
Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin
2016The Shortest Separating Cycle Problem.
Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng
2016Tight Approximation Bounds for the Seminar Assignment Problem.
Amotz Bar-Noy, George Rabanca
2016Vertex Sparsification in Trees.
Gramoz Goranci, Harald Räcke