default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. WAOA 2014: Wrocław, Poland
- Evripidis Bampis
, Ola Svensson:
Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8952, Springer 2015, ISBN 978-3-319-18262-9 - Alexander A. Ageev, Alexander V. Kononov:
Improved Approximations for the Max k-Colored Clustering Problem. 1-10 - Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. 11-22 - Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Better Algorithms for Online Bin Stretching. 23-34 - Martin Böhm, Jirí Sgall, Pavel Veselý:
Online Colored Bin Packing. 35-46 - Brian Brubach:
Improved Bound for Online Square-into-Square Packing. 47-58 - Bartosz Rybicki, Jaroslaw Byrka:
Improved Approximation Algorithm for Fault-Tolerant Facility Placement. 59-70 - Sin-Shuen Cheung:
The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem. 71-82 - Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Multi-Coloring with Advice. 83-94 - Nachshon Cohen, Zeev Nutov:
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points. 95-106 - Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis:
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling. 107-118 - Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage. 119-131 - Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo:
Linear-Time Approximation Algorithms for Unit Disk Graphs. 132-143 - Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset Problem. 144-155 - Wolfgang Dvorák, Monika Henzinger:
Online Ad Assignment with an Ad Exchange. 156-167 - Martina Eikel, Christian Scheideler, Alexander Setzer:
Minimum Linear Arrangement of Series-Parallel Graphs. 168-180 - Lene M. Favrholdt, Jesper W. Mikkelsen:
Online Dual Edge Coloring of Paths and Trees. 181-192 - Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online Packet Scheduling Under Adversarial Jamming. 193-206 - Ojas Parekh, David Pritchard:
Generalized Hypergraph Matching via Iterated Packing and Local Ratio. 207-223 - Rudolf Scheifele:
Steiner Trees with Bounded RC-Delay. 224-235 - Jirí Sgall, Gerhard J. Woeginger:
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms. 236-247 - Martijn van Ee, René Sitters:
Routing Under Uncertainty: The a priori Traveling Repairman Problem. 248-259 - Andreas Wierz, Britta Peis, S. Thomas McCormick:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. 260-272
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 2025-02-15 00:23 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:
