Advertisement

Approximation and Online Algorithms

15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers

  • Roberto Solis-Oba
  • Rudolf Fleischer
Conference proceedings WAOA 2017

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

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
    Pages 26-40
  3. Boaz Farbstein, Asaf Levin
    Pages 52-65
  4. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
    Pages 102-117
  5. Mário César San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer
    Pages 118-131
  6. Marcin Bienkowski, Artur Kraska, Paweł Schmidt
    Pages 132-146
  7. Janusz Januszewski, Łukasz Zielonka
    Pages 147-163
  8. Antonios Antoniadis, Kevin Schewior
    Pages 164-175
  9. Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra
    Pages 176-189
  10. Martin Böhm, Łukasz Jeż, Jiří Sgall, Pavel Veselý
    Pages 190-206
  11. Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers
    Pages 207-222
  12. Dariusz Dereniowski, Dorota Urbańska
    Pages 223-237
  13. Adrian Dumitrescu, Csaba D. Tóth
    Pages 238-252
  14. Allan Borodin, Denis Pankratov, Amirali Salehi-Abari
    Pages 253-268
  15. Felix Biermeier, Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide
    Pages 285-300
  16. Michele Flammini, Gianpiero Monaco, Qiang Zhang
    Pages 301-316
  17. Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz
    Pages 317-328
  18. Back Matter
    Pages 329-329

About these proceedings

Introduction

This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017.

The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 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; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Keywords

Approximation algorithms online algorithms combinatorial optimization networks game theory scheduling packing and covering graph theory approximation algorithms graphic methods telecommunication networks artificial intelligence cluster analysis clustering bin packing planar graph directed graphs randomized algorithms nash equilibrium

Editors and affiliations

  1. 1.The University of Western OntarioLondonCanada
  2. 2.German University of Technology in OmanMuscatOman

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-89441-6
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-89440-9
  • Online ISBN 978-3-319-89441-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering