SpringerLink
Log in

Approximation and Online Algorithms

21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Jarosław Byrka

    1. University of Wrocław, Wrocław, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andreas Wiese

    1. Technical University of Munich, Munich, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14297)

Included in the following conference series:

Conference proceedings info: WAOA 2023.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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

Keywords

Table of contents (16 papers)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. Approximation Ineffectiveness of a Tour-Untangling Heuristic

    • Bodo Manthey, Jesse van Rhijn
    Pages 1-13

  3. A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities

    • William Evans, David Kirkpatrick
    Pages 14-28

  4. Approximating Maximum Edge 2-Coloring by Normalizing Graphs

    • Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
    Pages 29-44

  5. An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem

    • Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk
    Pages 45-58

  6. Greedy Minimum-Energy Scheduling

    • Gunther Bidlingmaier
    Pages 59-73

  7. Scheduling with Speed Predictions

    • Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei
    Pages 74-89

  8. The Power of Amortization on Scheduling with Explorable Uncertainty

    • Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W. H. Wong, **ao-Ou Zhang
    Pages 90-103

  9. Total Completion Time Scheduling Under Scenarios

    • Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella et al.
    Pages 104-118

  10. Approximating Fair k-Min-Sum-Radii in Euclidean Space

    • Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla
    Pages 119-133

  11. Online Hitting Set of d-Dimensional Fat Objects

    • Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari
    Pages 134-144

  12. Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes

    • Vítor Gomes Chagas, Elisa Dell’Arriva, Flávio Keidi Miyazawa
    Pages 145-159

  13. Hitting Sets when the Shallow Cell Complexity is Small

    • Sander Aarts, David B. Shmoys
    Pages 160-174

  14. Any-Order Online Interval Selection

    • Allan Borodin, Christodoulos Karavasilis
    Pages 175-189

  15. Improved Approximations for Relative Survivable Network Design

    • Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
    Pages 190-204

  16. Independent Set in k-Claw-Free Graphs: Conditional \(\chi \)-Boundedness and the Power of LP/SDP Relaxations

    • Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase
    Pages 205-218

  17. Fast Parallel Algorithms for Submodular p-Superseparable Maximization

    • Philip Cervenjak, Junhao Gan, Anthony Wirth
    Pages 219-233

  18. Back Matter

    Pages 235-236
    Download chapter PDF
Back to top

Other volumes

  1. Approximation and Online Algorithms

Editors and Affiliations

  • University of Wrocław, Wrocław, Poland

    Jarosław Byrka

  • Technical University of Munich, Munich, Germany

    Andreas Wiese

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation