Verification problem of maximal points under uncertainty

DOI10.1007/978-3-642-45278-9_9MaRDI QIDQ2870019zbMATH OpenOpenAlexFDO

Authors

Publication date 17 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_9

Mathematics Subject Classification ID

Theory of data (68P99) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Efficient update strategies for geometric computing with uncertainty
• scientific article; zbMATH DE number 2011841
• Minimum spanning tree verification under uncertainty
• scientific article; zbMATH DE number 1507301
• Approximating largest convex hulls for imprecise points

Cited in

(8)

• Query-competitive sorting with uncertainty
• Round-competitive algorithms for uncertainty problems with parallel queries
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
• Query-Competitive Sorting with Uncertainty.
• Query minimization under stochastic uncertainty
• Round-competitive algorithms for uncertainty problems with parallel queries
• On the complexity of knapsack under explorable uncertainty: hardness and algorithms
• Query-competitive algorithms for cheapest set problems under uncertainty

This page was built for publication: Verification problem of maximal points under uncertainty

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