Theoretical Computer Science and General Issues
cover

Approximation and Online Algorithms

18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers

Editors: Kaklamanis, Christos, Levin, Asaf (Eds.)

Buy this book

eBook 117,69 €
price for Spain (gross)
  • ISBN 978-3-030-80879-2
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 145,59 €
price for Spain (gross)
  • ISBN 978-3-030-80878-5
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in  September 2020 as part of ALGO 2020.

The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications.

Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Table of contents (15 chapters)

Table of contents (15 chapters)
  • LP-Based Algorithms for Multistage Minimization Problems

    Pages 1-15

    Bampis, Evripidis (et al.)

  • A Faster FPTAS for Knapsack Problem with Cardinality Constraint

    Pages 16-29

    Li, Wenxin (et al.)

  • Distributed Algorithms for Matching in Hypergraphs

    Pages 30-46

    Hanguir, Oussama (et al.)

  • Online Coloring and a New Type of Adversary for Online Graph Problems

    Pages 47-62

    Li, Yaqiao (et al.)

  • Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique

    Pages 63-80

    Schäfer, Guido (et al.)

Buy this book

eBook 117,69 €
price for Spain (gross)
  • ISBN 978-3-030-80879-2
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 145,59 €
price for Spain (gross)
  • ISBN 978-3-030-80878-5
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
  • Usually ready to be dispatched within 3 to 5 business days, if in stock
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Services for this Book

Bibliographic Information

Bibliographic Information
Book Title
Approximation and Online Algorithms
Book Subtitle
18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers
Editors
  • Christos Kaklamanis
  • Asaf Levin
Series Title
Theoretical Computer Science and General Issues
Series Volume
12806
Copyright
2021
Publisher
Springer International Publishing
Copyright Holder
Springer Nature Switzerland AG
eBook ISBN
978-3-030-80879-2
DOI
10.1007/978-3-030-80879-2
Softcover ISBN
978-3-030-80878-5
Edition Number
1
Number of Pages
XII, 237
Number of Illustrations
22 b/w illustrations, 9 illustrations in colour
Topics