Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 16077)
Included in the following conference series:
Conference proceedings info: WAOA 2025.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation and Online Algorithms, WAOA 2025, held in Warsaw, Poland, during September 18–19, 2025.
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.
Similar content being viewed by others
Table of contents (16 papers)
-
Front Matter
-
Back Matter
Other volumes
-
Approximation and Online Algorithms
Editors and Affiliations
Accessibility Information
PDF accessibility summary
This PDF has been created in accordance with the PDF/UA-1 standard to enhance accessibility, including screen reader support, described non-text content (images, graphs), bookmarks for easy navigation, keyboard-friendly links and forms and searchable, selectable text. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. Please note that a more accessible version of this eBook is available as ePub.
EPUB accessibility summary
This ebook is designed with accessibility in mind, aiming to meet the ePub Accessibility 1.0 AA and WCAG 2.2 Level AA standards. It features a navigable table of contents, structured headings, and alternative text for images, ensuring smooth, intuitive navigation and comprehension. The text is reflowable and resizable, with sufficient contrast. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com.
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18–19, 2025, Proceedings
Editors: Jannik Matuschke, José Verschae
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-032-06706-7
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0), Springer Nature Proceedings Computer Science
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2026
Softcover ISBN: 978-3-032-06705-0Published: 02 October 2025
eBook ISBN: 978-3-032-06706-7Published: 30 September 2025
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 229
Number of Illustrations: 7 b/w illustrations, 22 illustrations in colour
Topics: Computational Mathematics and Numerical Analysis, Data Structures and Information Theory, Discrete Mathematics in Computer Science, Symbolic and Algebraic Manipulation, Numerical Analysis, Algorithm Analysis and Problem Complexity
Keywords
- 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
- Scheduling problems