Approximation and Online Algorithms

22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings
Erscheinungsjahr 2025
ISBN: 978-3-031-81395-5
Verlag: Springer Nature Switzerland

Buch, Englisch, Band 15269, 229 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 376 g

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5–6, 2024. 

The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.

Zielgruppe

Research

Autoren/Hrsg.

Englert, Matthias

Bienkowski, Marcin

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

.- Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms.

.- Improved online scheduling with restarts on a single machine.

.- Searching in Euclidean Spaces with Predictions.

.- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths..

.- Approximating delta-Covering.

.- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching.

.- Approximation Algorithms for k-Scenario Matching.

.- Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees.

.- Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line.

.- Maximizing Throughput for Parallel Jobs with Speed-up Curves.

.- Improved approximation algorithms for covering pliable set families and flexible graph connectivity.

.- Small additive error for unsplittable multicommodity flow in outerplanar graphs.

.- Complexity of Fixed Order Routing.

.- Approximate Min-Sum Subset Convolution.

.- Online String Attractors.