Approximation and Online Algorithms 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers / [electronic resource] :
edited by Christos Kaklamanis, Asaf Levin.
- 1st ed. 2021.
- XII, 237 p. 31 illus., 9 illus. in color. online resource.
- Theoretical Computer Science and General Issues, 12806 2512-2029 ; .
- Theoretical Computer Science and General Issues, 12806 .
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.
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.
9783030808792
10.1007/978-3-030-80879-2 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Data structures (Computer science).
Information theory.
Computer science.
Application software.
Algorithms.
Symbolic and Algebraic Manipulation.
Discrete Mathematics in Computer Science.
Data Structures and Information Theory.
Theory of Computation.
Computer and Information Systems Applications.
QA76.9.A43
518.1
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.
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.
9783030808792
10.1007/978-3-030-80879-2 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Data structures (Computer science).
Information theory.
Computer science.
Application software.
Algorithms.
Symbolic and Algebraic Manipulation.
Discrete Mathematics in Computer Science.
Data Structures and Information Theory.
Theory of Computation.
Computer and Information Systems Applications.
QA76.9.A43
518.1