default search action
17th WAOA 2019: Munich, Germany
- Evripidis Bampis, Nicole Megow:
Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11926, Springer 2020, ISBN 978-3-030-39478-3 - Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. 1-17 - János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. 18-28 - Pierre Bergé, Lou Salaün:
Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts. 29-42 - Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof:
Robust Online Algorithms for Certain Dynamic Packing Problems. 43-59 - Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. 60-71 - Graham Cormode, Pavel Veselý:
Streaming Algorithms for Bin Packing and Vector Scheduling. 72-88 - Karl Däubel:
An Improved Upper Bound for the Ring Loading Problem. 89-105 - Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem. 106-119 - Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Managing Multiple Mobile Resources. 120-137 - Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. 138-153 - Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Approximate Strong Edge-Colouring of Unit Disk Graphs. 154-169 - Felix Happach, Andreas S. Schulz:
Precedence-Constrained Scheduling and Min-Sum Set Cover. 170-187 - Tanmay Inamdar, Kasturi R. Varadarajan:
Fault Tolerant Clustering with Outliers. 188-201 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. 202-216 - Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. 217-231 - Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
Fair Coresets and Streaming Algorithms for Fair k-means. 232-251
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.