Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
SIAM Journal on Computing, 2020.
In the weighted flow-time problem on a single machine, we are given a set of $n$ jobs, where each job has a processing requirement $p_j$, release date $r_j$, and weight $w_j$. The goal is to find a...
Full Text (Upload PDF)
PPT (Upload PPT)