Graph Burning and Non-uniform k-centers for Small Treewidth
Gespeichert in:
| Veröffentlicht in: | WAOA (Veranstaltung : 20. : 2022 : Potsdam) Approximation and online algorithms |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Titel | Jahr | Verfasser |
|---|---|---|
| Approximating Length-Restricted Means Under Dynamic Time Warping | 2022 | Buchin, Maike |
| Locating Service and Charging Stations | 2022 | Dabas, Rajni |
| Scheduling with Machine Conflicts | 2022 | Buchem, Moritz |
| Scheduling Appointments Online: The Power of Deferred Decision-Making | 2022 | Smedira, Devin |
| Knapsack Secretary Through Boosting | 2022 | Abels, Andreas |
| An Improved Algorithm for Open Online Dial-a-Ride | 2022 | Baliegács, Júlia |
| Stochastic Graph Exploration with Limited Resources | 2022 | Cohen, Ilan Reuven |
| The Power of Amortized Recourse for Online Graph Problems | 2022 | Liu, Alison Hsiang-Hsuan |
| On Streaming Algorithms for Geometric Independent Set and Clique | 2022 | Bhore, Sujoy |
| Canadian Traveller Problem with Predictions | 2022 | Bampis, Evripidis |
| Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem | 2022 | Hellerstein, Lisa |
| Graph Burning and Non-uniform k-centers for Small Treewidth | 2022 | Lieskovsky, Matej |