Algorithms for minimizing weighted flow time
Discrete mobile centers
Proceedings of the seventeenth annual symposium on Computational geometry - SCG ’01
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01
Leonidas Guibas
Sanjeev Khanna
Li Zhang
John Hershberger
Chandra Chekuri
Jie Gao
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks
Multi-processor scheduling to minimize flow time with ? resource augmentation