Set selection with uncertain weights: non-adaptive queries and thresholds

DOI10.1007/978-3-032-27732-9_20MaRDI QIDQ7363389zbMATH OpenFDO

Authors Christoph Dürr, Arturo I. Merino, José A. Soto, José Verschae

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_20

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• A simpler minimum spanning tree verification algorithm
• An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
• Applications of Path Compression on Balanced Trees
• 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?)
• Minimum spanning tree under explorable uncertainty in theory and experiments
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
• The update complexity of selection and related problems
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time

This page was built for publication: Set selection with uncertain weights: non-adaptive queries and thresholds

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