Minimizing average flow-time: Upper and lower bounds

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 603-613

  Garg, Naveen ^a   Kumar, Amit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; MILITARY DATA PROCESSING;

APPROXIMABILITY; COMPETITIVE RATIOS; FLOW-TIME; INTEGRALITY GAPS; LOWER BOUNDS; LP-RELAXATION; MULTIPLE MACHINES; NON-TRIVIAL; ON LINE ALGORITHMS; PARALLEL MACHINES; PROCESSING TIMES; UNRELATED MACHINES; UNSPLITTABLE FLOW; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 46749133554     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389529     Document Type: Conference Paper

References (12)

1. N. Avrahami and Y. Azar. Minimizing total flow time and total completion time with immediate dispatching. In Proc. 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 11-18, 2003.
2. B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing, pages 198-205, 1999.
3. C. Cnekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In ACM Symposium on Theory of Computing, pages 84-93, 2001.
4. Y. Dinitz, N. Garg, and M. X. Goemans. On the single-source unsplittable flow problem. In IEEE Symposium on Foundations of Computer Science, pages 290-299, 1998.
5. M. Garey and D. Johson. Computers and intractability - a guide to NP-completeness. W.H. Freeman and Company, 1979.
6. N. Garg and A. Kumar. Better algorithms for minimizing average flow-time on related machines. In ICALP, pages 181-190, 2006.
7. N. Garg and A. Kumar. Minimizing average flow-time on related machines. In ACM Symposium on Theory of Computing, pages 730-738, 2006.
8. K. Jansen and L. Porkolab. Improved approximation schemes for scheduling unrelated parallel machines. In ACM Symposium on Theory of Computing, pages 408-417, 1999.
9. V. Kann. Maximum bounded 3-dimensional matching is max snp-complete. Information Processing Letters, 37:27-35, 1991.
10. H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In ACM Symposium on Theory of Computing, pages 418-426, 1996.
11. J. K. Lenstra, D. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machine. Mathematical Programming, 46(3):259-271, 1990.
12. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In ACM Symposium on Theory of Computing, pages 110-119, 1997.