© 2018

Approximation and Online Algorithms

16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers

  • Leah Epstein
  • Thomas Erlebach
Conference proceedings WAOA 2018

Part of the Lecture Notes in Computer Science book series (LNCS, volume 11312)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 11312)

Table of contents

  1. Front Matter
    Pages I-X
  2. Invited Contribution

    1. Front Matter
      Pages 1-1
  3. Regular Papers

    1. Front Matter
      Pages 19-19
    2. Yossi Azar, Amit Jacob Fanani
      Pages 21-35
    3. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
      Pages 36-50
    4. Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, Paweł Schmidt
      Pages 51-68
    5. Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
      Pages 69-86
    6. Jarosław Byrka, Mateusz Lewandowski, Joachim Spoerhase
      Pages 87-101
    7. Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
      Pages 102-117
    8. Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner
      Pages 118-133
    9. Gruia Calinescu, Guy Kortsarz, Zeev Nutov
      Pages 134-148
    10. Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
      Pages 149-164
    11. George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis
      Pages 165-180
    12. Artur Czumaj, Yishay Mansour, Shai Vardi
      Pages 181-203
    13. Anne Driemel, Amer Krivošija
      Pages 218-237
    14. Yaron Fairstein, Seffi (Joseph) Naor, Danny Raz
      Pages 238-258
    15. Motoki Ikeda, Shin-ichi Tanigawa
      Pages 277-294

About these proceedings


This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018.
The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.


approximation algorithms competitive ratio computer networks graph theory on-line algorithms probability problem solving set theory telecommunication networks telecommunication traffic

Editors and affiliations

  • Leah Epstein
    • 1
  • Thomas Erlebach
    • 2
  1. 1.University of HaifaHaifaIsrael
  2. 2.University of LeicesterLeicesterUK

Bibliographic information