The following pages link to The Geometry of Scheduling (Q5173251):
Displaying 22 items.
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- The TV advertisements scheduling problem (Q1733325) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- Demand Hitting and Covering of Intervals (Q2971657) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- (Q4612478) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- (Q5091054) (← links)
- (Q5091246) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- Covering segments with unit squares (Q5894547) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
