The Minimum Cost Query Problem on Matroids with Uncertainty Areas.

DOI10.4230/LIPIcs.ICALP.2019.83OpenAlexW2966645553MaRDI QIDQ5091242

Arturo I. Merino, Jose A. Soto

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1904.11668

zbMATH Keywords

uncertaintymatroidsminimum spanning treequeries

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• The update complexity of selection and related problems
• Efficient update strategies for geometric computing with uncertainty
• On combinatorial optimization problems on matroids with uncertain weights
• Query-competitive algorithms for cheapest set problems under uncertainty
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• The dependence graph for bases in matroids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Verification Problem of Maximal Points under Uncertainty
• Computing shortest paths with uncertainty
• Computing the Median with Uncertainty
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• The robust spanning tree problem with interval data

This page was built for publication: The Minimum Cost Query Problem on Matroids with Uncertainty Areas.