Approximation and Online Algorithms (Heftet)

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

Serie: Lecture Notes in Computer Science 12806

Innbinding: Heftet
Utgivelsesår: 2021
Antall sider: 237
Forlag: Springer Nature Switzerland AG
Språk: Engelsk
Serienummer: 12806
ISBN/EAN: 9783030808785
Kategori: Data og Matematikk
Omtale Approximation and Online Algorithms
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

Til toppen

Bøker i serien