Stefano Leonardi. A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines. In Evripidis Bampis, Klaus Jansen, Claire Kenyon, editors, Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Volume 3484 of Lecture Notes in Computer Science, pages 203-212, Springer, 2006. [doi]
Abstract is missing.