Read While You Wait - Get immediate ebook access, if available*, when you order a print book

Theoretical Computer Science and General Issues

Approximation and Online Algorithms

17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers

Editors: Bampis, Evripidis, Megow, Nicole (Eds.)

Free Preview

Buy this book

eBook $54.99
price for USA in USD (gross)
  • ISBN 978-3-030-39479-0
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $69.99
price for USA in USD
  • Customers within the U.S. and Canada please contact Customer Service at +1-800-777-4643, Latin America please contact us at +1-212-460-1500 (24 hours a day, 7 days a week). Pre-ordered printed titles are excluded from promotions.
  • Due: January 25, 2020
  • ISBN 978-3-030-39478-3
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
About this book

This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 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.

Table of contents (17 chapters)

Table of contents (17 chapters)
  • Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains

    Pages 1-17

    Ashur, Stav (et al.)

  • A New Lower Bound for Classic Online Bin Packing

    Pages 18-28

    Balogh, János (et al.)

  • Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts

    Pages 29-42

    Bergé, Pierre (et al.)

  • Robust Online Algorithms for Certain Dynamic Packing Problems

    Pages 43-59

    Berndt, Sebastian (et al.)

  • Approximation Results for Makespan Minimization with Budgeted Uncertainty

    Pages 60-71

    Bougeret, Marin (et al.)

Buy this book

eBook $54.99
price for USA in USD (gross)
  • ISBN 978-3-030-39479-0
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $69.99
price for USA in USD
  • Customers within the U.S. and Canada please contact Customer Service at +1-800-777-4643, Latin America please contact us at +1-212-460-1500 (24 hours a day, 7 days a week). Pre-ordered printed titles are excluded from promotions.
  • Due: January 25, 2020
  • ISBN 978-3-030-39478-3
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Approximation and Online Algorithms
Book Subtitle
17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers
Editors
  • Evripidis Bampis
  • Nicole Megow
Series Title
Theoretical Computer Science and General Issues
Series Volume
11926
Copyright
2020
Publisher
Springer International Publishing
Copyright Holder
Springer Nature Switzerland AG
eBook ISBN
978-3-030-39479-0
DOI
10.1007/978-3-030-39479-0
Softcover ISBN
978-3-030-39478-3
Edition Number
1
Number of Pages
XII, 253
Number of Illustrations
19 b/w illustrations, 25 illustrations in colour
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.