Minimizing total flow-time: The unrelated case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5369 LNCS, Issue , 2008, Pages 424-435

  Garg, Naveen ^a   Kumar, Amit ^a   Muralidhara, V N ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL THEORY; OPTIMIZATION;

APPROXIMABILITY; FLOW-TIME; LOWER BOUNDS; OPTIMUM ALGORITHM; PARALLEL MACHINES;

APPROXIMATION ALGORITHMS;

EID: 58549090553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_39     Document Type: Conference Paper

References (7)

1. Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In: STOC, pp. 363-372 (2004)
2. Dinitz, Y., Garg, N., Goemans, M.X.: On the single-source unsplittable flow problem. In: FOCS, pp. 290-299 (1998)
3. Garey, M.R., Johson, D.S.: Computers and intractability - a guide to NP-completeness. W.H. Freeman and Company, New York (1979)
4. Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 181-190. Springer, Heidelberg (2006)
5. Garg, N., Kumar, A.: Minimizing average flow-time: Upper and lower bounds. In: FOCS, pp. 603-613 (2007)
6. Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110-119 (1997)
7. Sitters, R.: Minimizing flow-time for unrelated machines. In: Personal Communication (2008)