Format:
1 Online-Ressource(XII, 237 p. 31 illus., 9 illus. in color.)
Edition:
1st ed. 2021.
ISBN:
9783030808792
Series Statement:
Theoretical Computer Science and General Issues 12806
Content:
Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques.
Content:
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.
Additional Edition:
ISBN 9783030808785
Additional Edition:
ISBN 9783030808808
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783030808785
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783030808808
Additional Edition:
Erscheint auch als Druck-Ausgabe WAOA (18. : 2020 : Online) Approximation and Online Algorithms Cham : Springer, 2021 ISBN 9783030808785
Language:
English
Keywords:
Approximation
;
Komplexitätstheorie
;
Spieltheorie
;
Konferenzschrift
DOI:
10.1007/978-3-030-80879-2
