Buchumschlag

Approximation and Online Algorithms 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings /

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: SpringerLink (Online service)
Weitere Verfasser: Bieńkowski, Marcin (HerausgeberIn), Englert, Matthias (HerausgeberIn)
Format: Elektronisch E-Book
Sprache:Englisch
Veröffentlicht: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Ausgabe:1st ed. 2025.
Schriftenreihe:Lecture Notes in Computer Science, 15269
Schlagworte:
Mathematics > Data processing.
Data structures (Computer science).
Information theory.
Computer science > Mathematics.
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.
Online-Zugang:https://doi.org/10.1007/978-3-031-81396-2
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Inhaltsangabe:
  • -- 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.

Ähnliche Einträge