1 option
Approximation and Online Algorithms : 23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18–19, 2025, Proceedings / edited by Jannik Matuschke, José Verschae.
Springer Nature - Springer Computer Science eBooks 2026 English International Available online
View online- Format:
- Book
- Author/Creator:
- Matuschke, Jannik.
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 16077
- Language:
- English
- Subjects (All):
- Mathematics--Data processing.
- Mathematics.
- Data structures (Computer science).
- Information theory.
- Computer science--Mathematics.
- Computer science.
- Discrete mathematics.
- Numerical analysis.
- Algorithms.
- Computational Mathematics and Numerical Analysis.
- Data Structures and Information Theory.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Numerical Analysis.
- Design and Analysis of Algorithms.
- Local Subjects:
- Computational Mathematics and Numerical Analysis.
- Data Structures and Information Theory.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Numerical Analysis.
- Design and Analysis of Algorithms.
- Physical Description:
- 1 online resource (429 pages)
- Edition:
- 1st ed. 2026.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2026.
- Summary:
- 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.
- Contents:
- Interval-Constrained Bipartite Matching over Time.
- The Online Piercing Set Problem With Recourse.
- Online General Knapsack with Reservation Costs.
- Simple Approximations for General Spanner Problems.
- Hardness of Dynamic Core and Truss Decompositions.
- Controlling Tail Risk in Two-Slope Ski Rental.
- Incremental–Decremental Maximization.
- Robust Scheduling on Uniform Machines.
- Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem.
- Low Recourse Arborescence Forests Under Uniformly Random Arcs.
- On the FirstFit Algorithm for Online Unit-Interval Coloring.
- Buy-at-Bulk Facility Location on Trees.
- Improved Online Sorting.
- Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three.
- Approximation algorithms for graph search problems with imperfect detection.
- ISBN:
- 3-032-06706-5
- 9783032067067
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.