Collection
Approximation and Online Algorithms (WAOA 2018)
- Submission status
- Closed
This collection of Theory of Computing Systems is devoted to selected papers from the Sixteenth International Workshop on Approximation and Online Algorithms (WAOA 2018), which was held in Helsinki, Finland, on 23–24 August 2018. Of the 44 papers submitted to WAOA 2018, 19 were accepted for presentation at the workshop, and revised and expanded versions of five papers appear in this special issue. All the contributions presented here were invited to this collection, but went through the standard refereeing process of Theory of Computing Systems.
Editors
-
Leah Epstein
Leah Epstein is a full professor in the Department of Mathematics, University of Haifa, Israel.
-
Thomas Erlebach
Thomas Erlebach is a full professor at Department of Computer Science at Durham University, UK.
Articles (5 in this collection)
-
-
Special Issue on Approximation and Online Algorithms
Authors
- Leah Epstein
- Thomas Erlebach
- Content type: EditorialNotes
- Published: 24 January 2020
- Pages: 569 - 570
-
Deterministic Min-Cost Matching with Delays
Authors
- Yossi Azar
- Amit Jacob Fanani
- Content type: OriginalPaper
- Published: 06 January 2020
- Pages: 572 - 592
-
Advice Complexity of Priority Algorithms
Authors (first, second and last of 4)
- Allan Borodin
- Joan Boyar
- Denis Pankratov
- Content type: OriginalPaper
- Published: 13 November 2019
- Pages: 593 - 625
-
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Authors (first, second and last of 4)
- Minjun Chang
- Dorit S. Hochbaum
- Mark Velednitsky
- Content type: OriginalPaper
- Published: 07 September 2019
- Pages: 645 - 661