Pages that link to "Item:Q3579232"
From MaRDI portal
The following pages link to Approximation schemes for preemptive weighted flow time (Q3579232):
Displaying 13 items.
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
