Approximation and Online Algorithms
23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18–19, 2025, Proceedings
Springer
ISBN 978-3-032-06705-0
Standardpreis
Bibliografische Daten
Fachbuch
Buch. Softcover
2025
7 s/w-Abbildungen, 22 Farbabbildungen.
Umfang: xiv, 229 S.
Format (B x L): 15,5 x 23,5 cm
Verlag: Springer
ISBN: 978-3-032-06705-0
Weiterführende bibliografische Daten
Das Werk ist Teil der Reihe: Lecture Notes in Computer Science
Produktbeschreibung
The 15 full papers included in this book were carefully reviewed and selected from 43 submissions. WAOA 2025 invited submissions on topics related to approximation and online algorithms, including algorithmic game theory, coloring and partitioning,computational economics and mechanism design, experimental methods for approximation and online algorithms, FPT-approximation algorithms, geometric problems, graph algorithms and network design, inapproximability results, packing and covering, matroids and submodular functions, new paradigms in approximation and online optimization, online selection problems, resource augmentation, relaxations and tightness of formulations, robust and stochastic problems,and scheduling problems.
Autorinnen und Autoren
Produktsicherheit
Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com