Approximation and Online Algorithms

This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation and Online Algorithms, WAOA 2025, held in Warsaw, Poland, during September 1819, 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.

Inhalt

.- 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.
.- IncrementalDecremental 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.