The following pages link to (Q4910726):
Displaying 24 items.
- The update complexity of selection and related problems (Q315536) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- 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)
- 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)
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q3452848) (← links)
- Algorithms for Queryable Uncertainty (Q4632163) (← links)
- (Q4993294) (← 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)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
- The power of amortization on scheduling with explorable uncertainty (Q6574932) (← links)
