The following pages link to (Q4952713):
Displayed 11 items.
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- (Q5075798) (← links)
- (Q5136269) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)