Minimum spanning tree under explorable uncertainty in theory and experiments

DOI10.4230/LIPICS.SEA.2017.22MaRDI QIDQ4580177zbMATH OpenFDO

Authors Jacob Focke, Nicole Megow, Julie Meißner

Publication date 13 August 2018

zbMATH Keywords

MSTcompetitive ratioexperimental algorithmsexplorable uncertainty

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

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

Cited in

(12)

• Query-competitive sorting with uncertainty
• Query-Competitive Sorting with Uncertainty.
• Round-competitive algorithms for uncertainty problems with parallel queries
• Scheduling with a processing time oracle
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
• Computing minimum spanning trees with uncertainty
• An adversarial model for scheduling with testing
• Minimum spanning tree verification under uncertainty
• Randomization helps computing a minimum spanning tree under uncertainty
• A robust optimization approach with probe-able uncertainty
• Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments

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)