All Outputs (3)

Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty (2022)
Conference Proceeding
Erlebach, T., de Lima, M. S., Megow, N., & Schlöter, J. (2022). Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (12:1-12:16). https://doi.org/10.4230/lipics.esa.2022.12

We study how to utilize (possibly erroneous) predictions in a model for computing under uncertainty in which an algorithm can query unknown data. Our aim is to minimize the number of queries needed to solve the minimum spanning tree problem, a fundam... Read More about Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.

Package Delivery Using Drones with Restricted Movement Areas (2022)
Conference Proceeding
Erlebach, T., Luo, K., & Spieksma, F. C. (in press). Package Delivery Using Drones with Restricted Movement Areas. In S. W. Bae, & H. Park (Eds.), . https://doi.org/10.4230/lipics.isaac.2022.49

Parameterized temporal exploration problems (2022)
Conference Proceeding
Erlebach, T., & Spooner, J. T. (2022). Parameterized temporal exploration problems. In J. Aspnes, & O. Michail (Eds.), . https://doi.org/10.4230/lipics.sand.2022.15

In this paper we study the fixed-parameter tractability of the problem of deciding whether a given temporal graph G admits a temporal walk that visits all vertices (temporal exploration) or, in some problem variants, a certain subset of the vertices.... Read More about Parameterized temporal exploration problems.