default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st WAOA 2023: Amsterdam, The Netherlands
- Jaroslaw Byrka, Andreas Wiese:
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings. Lecture Notes in Computer Science 14297, Springer 2023, ISBN 978-3-031-49814-5 - Bodo Manthey, Jesse van Rhijn
:
Approximation Ineffectiveness of a Tour-Untangling Heuristic. 1-13 - William S. Evans, David G. Kirkpatrick:
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. 14-28 - Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze:
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. 29-44 - Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk:
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem. 45-58 - Gunther Bidlingmaier:
Greedy Minimum-Energy Scheduling. 59-73 - Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei:
Scheduling with Speed Predictions. 74-89 - Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W. H. Wong, Xiao-Ou Zhang:
The Power of Amortization on Scheduling with Explorable Uncertainty. 90-103 - Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie:
Total Completion Time Scheduling Under Scenarios. 104-118 - Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla:
Approximating Fair k-Min-Sum-Radii in Euclidean Space. 119-133 - Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari:
Online Hitting Set of d-Dimensional Fat Objects. 134-144 - Vítor Gomes Chagas, Elisa Dell'Arriva, Flávio Keidi Miyazawa:
Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes. 145-159 - Sander Aarts, David B. Shmoys:
Hitting Sets when the Shallow Cell Complexity is Small. 160-174 - Allan Borodin, Christodoulos Karavasilis:
Any-Order Online Interval Selection. 175-189 - Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov:
Improved Approximations for Relative Survivable Network Design. 190-204 - Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. 205-218 - Philip Cervenjak, Junhao Gan, Anthony Wirth:
Fast Parallel Algorithms for Submodular p-Superseparable Maximization. 219-233
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
