Multi-processor scheduling to minimize flow time with ? resource augmentation
Approximation schemes for preemptive weighted flow time
Algorithms for minimizing weighted flow time
Embedding k-Outerplanar Graphs into l1
SIAM Journal on Discrete Mathematics
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Sanjeev Khanna
Ilan Newman
An Zhu
Amit Kumar
Alistair Sinclair
Anupam Gupta
Serendipity
Metric embedding via shortest path decompositions