Algorithms for Queryable Uncertainty

DOI10.1007/978-3-319-39817-4_1zbMath1475.68461OpenAlexW2506630972MaRDI QIDQ4632163

Erlebach, Thomas

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_1

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The robust knapsack problem with queries
• Efficient update strategies for geometric computing with uncertainty
• Query-competitive algorithms for cheapest set problems under uncertainty
• The update complexity of selection and related problems
• Input-Thrifty Extrema Testing
• Computing shortest paths with uncertainty
• Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Computing the Median with Uncertainty

This page was built for publication: Algorithms for Queryable Uncertainty