Approximation and online algorithms : 21st international workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023 : proceedings

Approximation and online algorithms 21st international workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023 : proceedings

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, 2023 The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: WAOA (VerfasserIn)
Weitere Verfasser: Byrka, Jarosław (HerausgeberIn), Wiese, Andreas (HerausgeberIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: Cham Springer 2023
Schriftenreihe:Lecture notes in computer science 14297
Schlagworte:
Mathematics > Data structures (Computer science). > Information theory. > Computer science > Discrete mathematics. > Numerical analysis. > Algorithms. > Konferenzschrift
Online Zugang:Inhaltsverzeichnis
zbMATH
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Total Completion Time Scheduling Under Sceparios 2023 Bosman, Thomas
Independent Set in k-Claw-Free Graphs: Conditional x-Boundedness and the Power of LP/SDP Relaxations 2023 Chalermsook, Parinya
Scheduling with Speed Predictions 2023 Balkanski, Eric
The Power of Amortization on Scheduling with Explorable Uncertainty 2023 Liu, Alison Hsiang-Hsuan
Approximating Fair k-Min-Sum-Radii in Euclidean Space 2023 Drexler, Lukas
Hitting Sets when the Shallow Cell Complexity is Small 2023 Aarts, Sander
Any-Order Online Interval Selection 2023 Borodin, Allan
Approximation Ineffectiveness of a Tour-Untangling Heuristic 2023 Manthey, Bodo
Approximating Maximum Edge 2-Coloring by Normalizing Graphs 2023 Mömke, Tobias
Greedy Minimum-Energy Scheduling 2023 Bidlingmaier, Gunther
Online Hitting Set of d-Dimensional Fat Objects 2023 Alefkhani, Shanli
Fast Parallel Algorithms for Submodular p-Superseparable Maximization 2023 Cervenjak, Philip
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities 2023 Evans, William
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem 2023 Basiak, Mateusz
Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes 2023 Chagas, Vítor Gomes
Improved Approximations for Relative Survivable Network Design 2023 Dinitz, Michael
Alle Artikel auflisten