Round-competitive algorithms for uncertainty problems with parallel queries
(2022)
Journal Article
Erlebach, T., Hoffmann, M., & de Lima, M. S. (2023). Round-competitive algorithms for uncertainty problems with parallel queries. Algorithmica, 85(2), 406-443. https://doi.org/10.1007/s00453-022-01035-6
In computing with explorable uncertainty, one considers problems where the values of some input elements are uncertain, typically represented as intervals, but can be obtained using queries. Previous work has considered query minimization in the sett... Read More about Round-competitive algorithms for uncertainty problems with parallel queries.