Link Scheduling in Polynomial Time

IEEE Transactions on Information Theory

Volumn 34, Issue 5, 1988, Pages 910-917

  Hajek, Bruce ^a   Sasaki, Galen ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--POLYNOMIALS; SCHEDULING;

CONVERSATIONS; LINK SCHEDULING; POLYNOMIAL TIME; SPREAD SPECTRUM RADIO NETWORK;

RADIO TRANSMISSION;

EID: 0024079190     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.21215     Document Type: Article

References (11)

1. E. Arikan, “Some complexity results about packet radio networks,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 681–685, July 1984.
2. D. J. Baker, J. Wieselthier, and A. Ephremides, “A distributed algorithm for scheduling the activation of links in a self-organizing mobile radio network,” IEEE Int. Conf. Commun. Conf. Rec., Philadelphia, PA, June 1982, pp. 2F.6.1-2F.6.5.
3. C. Berge, Graphs and Hypergraphs. New York: North-Holland, 1976.
4. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and A. S. Lapaugh, “Scheduling file transfers,” SIAM J. Computing, to appear.
5. J. Edmonds, “Maximum matching and a polyhedron with (0,1) vertices,” J. Res. Nat. Bur. Standards, Sec. B, vol. 69, pp. 125–130, 1965.
6. Fiorni and Wilson, Edge-Colourings of Graphs. San Francisco, CA: Pitman, 1977.
7. M. Grotschel, L. Lovasz, and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorial vol. 1, no. 2, pp. 169–197, 1981.
8. B. Hajek, “Link schedules, flows, and the multichromatic index of graphs,” in Proc. 1984 Conf. Information Sciences and Systems, Mar. 1984, pp. 498–502.
9. B. Hajek and R. G. Ogier, “Optimal dynamic routing with continuous traffic,” Networks, vol. 14, pp. 457–487, 1984.
10. I. Hoyler, “The NP-completeness of edge-coloring,” SIAM J. Cormput., vol. 10, pp. 718-720,1981.
11. R. M. Karp and C. H. Papadimitriou, “On linear characterizations