The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
From MaRDI portal
Publication:5091242
DOI10.4230/LIPICS.ICALP.2019.83OpenAlexW2966645553MaRDI QIDQ5091242FDOQ5091242
Authors: Arturo I. Merino, José A. Soto 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.11668
Recommendations
- Query-competitive algorithms for cheapest set problems under uncertainty
- Query-competitive algorithms for cheapest set problems under uncertainty
- Randomization helps computing a minimum spanning tree under uncertainty
- On combinatorial optimization problems on matroids with uncertain weights
- On the complexity of a class of combinatorial optimization problems with uncertainty
Cites Work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The robust spanning tree problem with interval data
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- The update complexity of selection and related problems
- Computing the Median with Uncertainty
- Computing minimum spanning trees with uncertainty
- Efficient update strategies for geometric computing with uncertainty
- The dependence graph for bases in matroids
- On combinatorial optimization problems on matroids with uncertain weights
- Computing shortest paths with uncertainty
- Title not available (Why is that?)
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Query-competitive algorithms for cheapest set problems under uncertainty
- Verification problem of maximal points under uncertainty
Cited In (3)
This page was built for publication: The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091242)
