Minimum spanning tree under explorable uncertainty in theory and experiments
From MaRDI portal
Publication:4580177
DOI10.4230/LIPICS.SEA.2017.22zbMATH Open1433.68293MaRDI QIDQ4580177FDOQ4580177
Authors: Jacob Focke, Nicole Megow, Julie Meißner 
Publication date: 13 August 2018
Recommendations
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Computing minimum spanning trees with uncertainty
- Randomization helps computing a minimum spanning tree under uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Minimum spanning tree verification under uncertainty
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (12)
- Scheduling with a processing time oracle
- Query-Competitive Sorting with Uncertainty.
- Minimum spanning tree verification under uncertainty
- An adversarial model for scheduling with testing
- A robust optimization approach with probe-able uncertainty
- Query-competitive sorting with uncertainty
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Randomization helps computing a minimum spanning tree under uncertainty
- Computing minimum spanning trees with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
This page was built for publication: Minimum spanning tree under explorable uncertainty in theory and experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580177)
