Outputs (3)

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty (2021)
Presentation / Conference Contribution
Bampis, E., Dürr, C., Erlebach, T., de Lima, M. S., Megow, N., & Schlöter, J. (2021). Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. . https://doi.org/10.4230/lipics.esa.2021.10

Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node with minimum weight can be determined for each hyperedge. Querying a node... Read More about Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.

Exploration of k-Edge-Deficient Temporal Graphs (2021)
Presentation / Conference Contribution
Erlebach, T., & Spooner, J. T. (2021). Exploration of k-Edge-Deficient Temporal Graphs. . https://doi.org/10.1007/978-3-030-83508-8_27

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries (2021)
Presentation / Conference Contribution
Erlebach, T., Hoffmann, M., & de Lima, M. S. (2021). Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. . https://doi.org/10.4230/lipics.stacs.2021.27