Pages that link to "Item:Q2911635"
From MaRDI portal
The following pages link to The update complexity of selection and related problems (Q2911635):
Displaying 11 items.
- The update complexity of selection and related problems (Q315536) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q3452848) (← links)
- (Q3745325) (← links)
- Algorithms for Queryable Uncertainty (Q4632163) (← links)
- Computing the Median with Uncertainty (Q4706217) (← links)
- Scheduling with explorable uncertainty (Q4993294) (← links)
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time (Q6492085) (← links)