The following pages link to (Q4967181):
Displaying 20 items.
- Algorithms that access the input via queries (Q831777) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Computing and scheduling with explorable uncertainty (Q1670736) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty (Q2922614) (← links)
- Algorithms for Queryable Uncertainty (Q4632163) (← links)
- Computing the Median with Uncertainty (Q4706217) (← links)
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242) (← links)
- Query-Competitive Sorting with Uncertainty. (Q5092365) (← links)
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q5283242) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments (Q6039933) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
- Minimizing query frequency to bound congestion potential for moving entities at a fixed target time (Q6546591) (← links)
- A frequency-competitive query strategy for maintaining low collision potential among moving entities (Q6574921) (← links)
- The power of amortization on scheduling with explorable uncertainty (Q6574932) (← links)
