Pages that link to "Item:Q5283242"
From MaRDI portal
The following pages link to Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q5283242):
Displaying 12 items.
- Algorithms that access the input via queries (Q831777) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242) (← links)
- Query-Competitive Sorting with Uncertainty. (Q5092365) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
