On Approximating a Scheduling Problem

Journal of Combinatorial Optimization

Volumn 5, Issue 3, 2001, Pages 287-297

  Crescenzi, Pierluigi ^a   Deng, Xiaotie ^b   Papadimitriou, Christos H ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bipartite graph; Communication; Edge coloring; Parallel computation

Indexed keywords

EID: 0042471700     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011441109660     Document Type: Article

References (8)

1. G. Bongiovanni, D. Coppersmith, and C.K. Wong, "An optimal time slot assignment algorithm for an SS/TDMA system wit variable number of transponders," IEEE Trans. on Communications, vol. 29, pp. 721-726, 1981.
2. H. Choi and S.L. Hakimi, "Data transfers in networks," Algorithmica, vol. 3, pp. 223-245, 1988.
3. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, and A.S. Lapaugh, "Scheduling file transfers," SIAM J. Comput., vol. 14, pp. 744-780, 1985.
4. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems," SIAM J. Comput., vol. 5, pp. 691-703, 1976.
5. I.S. Gopal and C.K. Wong, "Minimizing the number of switchings in an SS/TDMA system," IEEE Trans. on Communications, vol. 33, pp. 497-501, 1985.
6. M. Goudreau, K. Lang, S.B. Rao, T. Suel, and T. Tsantilas, "Towards efficiency and portability: Programming with the BSP model," in Proc. SPAA, pp. 1-12, 1996.
7. E.L. Lawler and J. Labetoulle, "On preemptive scheduling of unrelated parallel processors by linear programming," J. ACM, vol. 25, pp. 612-619, 1978.
8. L.G. Valiant, "A bridging model for parallel computation," Comm. ACM, vol. 33, pp. 103-111, 1990.