Approximation and Online Algorithms 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings / [electronic resource] : edited by Parinya Chalermsook, Bundit Laekhanukit. - 1st ed. 2022. - XI, 255 p. 34 illus., 19 illus. in color. online resource. - Lecture Notes in Computer Science, 13538 1611-3349 ; . - Lecture Notes in Computer Science, 13538 .

Locating Service and Charging stations -- Graph burning and non-uniform $k$-centers for small treewidth -- Scheduling with Machine Conflicts -- Knapsack Secretary Through Boosting -- Scheduling Appointments Online: The Power of Deferred Decision-Making -- Canadian Traveller Problem with Predictions -- The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride -- Stochastic graph exploration with limited resources -- Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem -- On Streaming Algorithms for Geometric Independent Set and Clique -- Approximating Length-Restricted Means under Dynamic Time Warping.

This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022. The 12 papers included in these proceedings were carefully reviewed and selected from 21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc.

9783031183676

10.1007/978-3-031-18367-6 doi


Mathematics--Data processing.
Data structures (Computer science).
Information theory.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Algorithms.
Computational Mathematics and Numerical Analysis.
Data Structures and Information Theory.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Symbolic and Algebraic Manipulation.
Design and Analysis of Algorithms.

QA71-90

518