default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14. WAOA 2016: Aarhus, Denmark
- Klaus Jansen, Monaldo Mastrolilli:
Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10138, Springer 2017, ISBN 978-3-319-51740-7 - Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng:
The Shortest Separating Cycle Problem. 1-13 - Yossi Azar, Adi Vardi:
Dynamic Traveling Repair Problem with an Arbitrary Time Window. 14-26 - André Berger, Alexander Grigoriev
, Andrej Winokurow:
A PTAS for the Cluster Editing Problem on Planar Graphs. 27-39 - Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. 40-51 - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. 52-64 - Parinya Chalermsook, Daniel Vaz:
New Integrality Gap Results for the Firefighters Problem on Trees. 65-77 - Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy:
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. 78-91 - Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
Balanced Optimization with Vector Costs. 92-102 - Gramoz Goranci, Harald Räcke:
Vertex Sparsification in Trees. 103-115 - Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin:
Scenario Submodular Cover. 116-128 - Akira Matsubayashi:
Non-greedy Online Steiner Trees on Outerplanar Graphs. 129-141 - Astha Chauhan, N. S. Narayanaswamy:
A Refined Analysis of Online Path Coloring in Trees. 142-154 - Roy B. Ofer, Tami Tamir:
Resource Allocation Games with Multiple Resource Classes. 155-169 - Amotz Bar-Noy, George Rabanca:
Tight Approximation Bounds for the Seminar Assignment Problem. 170-182 - Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the Scenario Model. 183-196 - Felix J. L. Willamowski, Andreas Bley:
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. 197-209
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
