Byrka / Wiese Approximation and Online Algorithms

21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings
1. Auflage 2023
ISBN: 978-3-031-49815-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 14297, 236 Seiten, eBook

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were 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 the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems

Zielgruppe

Research

Autoren/Hrsg.

Byrka, Jaroslaw

Wiese, Andreas

Inhaltsverzeichnis

Optimization under Explorable Uncertainty: Adversarial and Stochastic Models.- Approximation Ineffectiveness of a Tour-Untangling Heuristic.- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities.- Approximating Maximum Edge 2-Coloring by Normalizing Graphs.- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem.- Greedy Minimum-Energy Scheduling.- Scheduling with Speed Predictions.- The Power of Amortization on Scheduling with Explorable Uncertainty.- Total Completion Time Scheduling Under Scenarios.- Approximating Fair k-Min-Sum-Radii in Euclidean Space.- Online hitting set of d-dimensional fat objects.- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes.- Hitting Sets when the Shallow Cell Complexity is Small.- Any-Order Online Interval Selection.- Improved Approximations for Relative Survivable Network Design.- Independent set in k-Claw-Free Graphs: Conditional ?-boundedness and the Power of LP/SDP Relaxations.- Fast Parallel Algorithms for Submodular p-Superseparable Maximization.