Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings

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 from21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc.

Sommario

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.

Dettagli sul prodotto

• Con la collaborazione di: Parinya Chalermsook (Editore), Laekhanukit (Editore), Bundit Laekhanukit (Editore)
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 21.10.2022
• EAN: 9783031183669
• ISBN: 978-3-0-3118366-9
• Pagine: 255
• Dimensioni: 155 mm x 14 mm x 235 mm
• Illustrazioni: XI, 255 p. 34 illus., 19 illus. in color.
• Serie: Lecture Notes in Computer Science
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Teoria delle probabilità, stocastica, statistica matematica