Approximation and Online Algorithms
20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings
Seiten
2022
|
1st ed. 2022
Springer International Publishing (Verlag)
978-3-031-18366-9 (ISBN)
Springer International Publishing (Verlag)
978-3-031-18366-9 (ISBN)
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.
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.
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.
| Erscheinungsdatum | 22.10.2022 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XI, 255 p. 34 illus., 19 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 410 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Analysis |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Adaptive Algorithms • approximation algorithms • Approximation Theory • combinatorial optimization • competitive ratio • Computer Networks • Correlation Analysis • graph algorithms and analysis • Graphic methods • graph theory • Mathematics • Numerical Model • online algorithms • On-line Algorithms • polynomial approximation • Probability • scheduling algorithms • stochastic approximation • streaming algorithms • theoretical computer science |
| ISBN-10 | 3-031-18366-5 / 3031183665 |
| ISBN-13 | 978-3-031-18366-9 / 9783031183669 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Grundlagen, Beispiele, Aufgaben, Lösungen
Buch | Hardcover (2022)
Hanser, Carl (Verlag)
29,99 €
