The following pages link to (Q4580177):
Displaying 7 items.
- Scheduling with a processing time oracle (Q2109845) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← 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 Sorting with Uncertainty. (Q5092365) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
