Pages that link to "Item:Q5236280"
From MaRDI portal
The following pages link to A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time (Q5236280):
Displaying 4 items.
- The online food delivery problem on stars (Q2079861) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
