1 citations · 2 across the 10 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques
Nicole Megow, Jens Schlöter
Given subsets of uncertain values, we study the problem of identifying the subset of minimum total value (sum of the uncertain values) by querying as few values as possible. This s…
cs.DS2022
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow +1
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…