E-Book, Englisch, Band 13538, 255 Seiten, eBook
Chalermsook / Laekhanukit Approximation and Online Algorithms
1. Auflage 2022
ISBN: 978-3-031-18367-6
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark
20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings
E-Book, Englisch, Band 13538, 255 Seiten, eBook
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-031-18367-6
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.