Advertisement

Approximation and Online Algorithms

14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers

  • Klaus Jansen
  • Monaldo Mastrolilli
Conference proceedings WAOA 2016

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

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

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng
    Pages 1-13
  3. André Berger, Alexander Grigoriev, Andrej Winokurow
    Pages 27-39
  4. Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes et al.
    Pages 40-51
  5. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
    Pages 52-64
  6. Parinya Chalermsook, Daniel Vaz
    Pages 65-77
  7. Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
    Pages 92-102
  8. Gramoz Goranci, Harald Räcke
    Pages 103-115
  9. Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin
    Pages 116-128
  10. Astha Chauhan, N. S. Narayanaswamy
    Pages 142-154
  11. Roy B. Ofer, Tami Tamir
    Pages 155-169
  12. Amotz Bar-Noy, George Rabanca
    Pages 170-182
  13. Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters
    Pages 183-196
  14. Back Matter
    Pages 211-211

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. 
The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real world applications, and scheduling problems.

Keywords

balanced optimization computational complexity online algorithms probability robust optimization algorithms assignment problem coloring competitive ratio correlation clustering general assignment graph approximation graph sparsification lower bound optimization packing and covering planar graphs shortest separating cycle traveling salesman problem trees

Editors and affiliations

  • Klaus Jansen
    • 1
  • Monaldo Mastrolilli
    • 2
  1. 1.Institut für InformatikChristian-Albrechts-UniversitätKielGermany
  2. 2.Istituto Dalle Molle di Studi sull’ Intelligenza ArtificialeManno (Lugano)Switzerland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-51741-4
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-51740-7
  • Online ISBN 978-3-319-51741-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Telecommunications
Engineering