Approximating Fair k-Min-Sum-Radii in Euclidean Space (English)
- New search for: Drexler, Lukas
- Further information on Drexler, Lukas:
- https://orcid.org/http://orcid.org/0000-0001-9395-6711
- New search for: Hennes, Annika
- Further information on Hennes, Annika:
- https://orcid.org/http://orcid.org/0000-0001-9109-3107
- New search for: Lahiri, Abhiruk
- Further information on Lahiri, Abhiruk:
- https://orcid.org/http://orcid.org/0009-0008-7556-3445
- New search for: Schmidt, Melanie
- Further information on Schmidt, Melanie:
- https://orcid.org/http://orcid.org/0000-0003-4856-3905
- New search for: Wargalla, Julian
- Further information on Wargalla, Julian:
- https://orcid.org/http://orcid.org/0000-0003-4583-7288
- New search for: Byrka, Jarosław
- New search for: Wiese, Andreas
- New search for: Drexler, Lukas
- Further information on Drexler, Lukas:
- https://orcid.org/http://orcid.org/0000-0001-9395-6711
- New search for: Hennes, Annika
- Further information on Hennes, Annika:
- https://orcid.org/http://orcid.org/0000-0001-9109-3107
- New search for: Lahiri, Abhiruk
- Further information on Lahiri, Abhiruk:
- https://orcid.org/http://orcid.org/0009-0008-7556-3445
- New search for: Schmidt, Melanie
- Further information on Schmidt, Melanie:
- https://orcid.org/http://orcid.org/0000-0003-4856-3905
- New search for: Wargalla, Julian
- Further information on Wargalla, Julian:
- https://orcid.org/http://orcid.org/0000-0003-4583-7288
In:
Approximation and Online Algorithms
: 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings
;
Chapter: 9
;
119-133
;
2023
- Article/Chapter (Book) / Electronic Resource
-
Title:Approximating Fair k-Min-Sum-Radii in Euclidean Space
-
Additional title:Lect.Notes Computer
-
Contributors:Byrka, Jarosław ( editor ) / Wiese, Andreas ( editor ) / Drexler, Lukas ( author ) / Hennes, Annika ( author ) / Lahiri, Abhiruk ( author ) / Schmidt, Melanie ( author ) / Wargalla, Julian ( author )
-
Conference:International Workshop on Approximation and Online Algorithms ; 2023 ; Amsterdam, The Netherlands
-
Published in:Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings ; Chapter: 9 ; 119-133Lecture Notes in Computer Science ; 14297 ; 119-133
-
Publisher:
- New search for: Springer Nature Switzerland
-
Place of publication:Cham
-
Publication date:2023-12-22
-
Size:15 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Approximation Ineffectiveness of a Tour-Untangling HeuristicManthey, Bodo / van Rhijn, Jesse et al. | 2023
- 2
-
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving EntitiesEvans, William / Kirkpatrick, David et al. | 2023
- 3
-
Approximating Maximum Edge 2-Coloring by Normalizing GraphsMömke, Tobias / Popa, Alexandru / Roshany-Tabrizi, Aida / Ruderer, Michael / Vincze, Roland et al. | 2023
- 4
-
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover ProblemBasiak, Mateusz / Bienkowski, Marcin / Tatarczuk, Agnieszka et al. | 2023
- 5
-
Greedy Minimum-Energy SchedulingBidlingmaier, Gunther et al. | 2023
- 6
-
Scheduling with Speed PredictionsBalkanski, Eric / Ou, Tingting / Stein, Clifford / Wei, Hao-Ting et al. | 2023
- 7
-
The Power of Amortization on Scheduling with Explorable UncertaintyLiu, Alison Hsiang-Hsuan / Liu, Fu-Hong / Wong, Prudence W. H. / Zhang, Xiao-Ou et al. | 2023
- 8
-
Total Completion Time Scheduling Under ScenariosBosman, Thomas / van Ee, Martijn / Ergen, Ekin / Imreh, Csanád / Marchetti-Spaccamela, Alberto / Skutella, Martin / Stougie, Leen et al. | 2023
- 9
-
Approximating Fair k-Min-Sum-Radii in Euclidean SpaceDrexler, Lukas / Hennes, Annika / Lahiri, Abhiruk / Schmidt, Melanie / Wargalla, Julian et al. | 2023
- 10
-
Online Hitting Set of d-Dimensional Fat ObjectsAlefkhani, Shanli / Khodaveisi, Nima / Mari, Mathieu et al. | 2023
- 11
-
Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other ShapesChagas, Vítor Gomes / Dell’Arriva, Elisa / Miyazawa, Flávio Keidi et al. | 2023
- 12
-
Hitting Sets when the Shallow Cell Complexity is SmallAarts, Sander / Shmoys, David B. et al. | 2023
- 13
-
Any-Order Online Interval SelectionBorodin, Allan / Karavasilis, Christodoulos et al. | 2023
- 14
-
Improved Approximations for Relative Survivable Network DesignDinitz, Michael / Koranteng, Ama / Kortsarz, Guy / Nutov, Zeev et al. | 2023
- 15
-
Independent Set in k-Claw-Free Graphs: Conditional \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi $$\end{document}-Boundedness and the Power of LP/SDP RelaxationsChalermsook, Parinya / Gadekar, Ameet / Khodamoradi, Kamyar / Spoerhase, Joachim et al. | 2023
- 16
-
Fast Parallel Algorithms for Submodular p-Superseparable MaximizationCervenjak, Philip / Gan, Junhao / Wirth, Anthony et al. | 2023