Algorithms for queryable uncertainty

DOI10.1007/978-3-319-39817-4_1MaRDI QIDQ4632163zbMATH OpenOpenAlexFDO

Authors Thomas Erlebach

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)

Recommendations

• scientific article; zbMATH DE number 7075885
• Query-competitive algorithms for cheapest set problems under uncertainty
• Query-competitive algorithms for cheapest set problems under uncertainty
• Algorithms that access the input via queries
• Round-competitive algorithms for uncertainty problems with parallel queries

Cites work

• Computing minimum spanning trees with uncertainty
• Computing shortest paths with uncertainty
• Computing the Median with Uncertainty
• Efficient update strategies for geometric computing with uncertainty
• scientific article; zbMATH DE number 7075885 (Why is no real title available?)
• Input-Thrifty Extrema Testing
• Model-driven optimization using adaptive probes
• Query-competitive algorithms for cheapest set problems under uncertainty
• Randomization helps computing a minimum spanning tree under uncertainty
• The robust knapsack problem with queries
• The update complexity of selection and related problems
• Two-sided online bipartite matching and vertex cover: beating the greedy algorithm

Cited in

(10)

• Computing and scheduling with explorable uncertainty
• Easy and optimal queries to reduce set uncertainty
• Round-competitive algorithms for uncertainty problems with parallel queries
• Query-competitive algorithms for cheapest set problems under uncertainty
• scientific article; zbMATH DE number 7075885 (Why is no real title available?)
• Querying with Uncertainty
• Query minimization under stochastic uncertainty
• Query minimization under stochastic uncertainty
• Algorithms that access the input via queries
• Query-competitive algorithms for cheapest set problems under uncertainty

This page was built for publication: Algorithms for queryable uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632163)