A comparison of network coding and tree packing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 143-

  Wu, Yunnan ^a   Chou, Philip A ^b   Jain, Kamal ^b  

^a Princeton University   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDMONDS' THEOREMS; LOVASZ' PROOF; PRIM'S ALGORITHMS; TREE PACKING;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INFORMATION RETRIEVAL SYSTEMS; INTERNET; MULTICASTING; POLYNOMIALS; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS; SIGNAL ENCODING; TELECOMMUNICATION SERVICES; THEOREM PROVING; TREES (MATHEMATICS);

PACKET NETWORKS;

EID: 5044243408     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. K. Jain, M. Mahdian, M.R. Salavatipour, "Packing Steiner trees," 14th ACM-SIAM Symp. on Discrete Algorithms, 2003.
2. L. Lovasz, "On two minimax theorems in graph theory," J. Combin. Theory B 21, pp. 96-103, 1976.
3. J. Edmonds, "Edge-disjoint branchings," in: Combinatorial Algorithms, ed. R. Rustin, pp. 91-96, Academic Press, NY, 1973.
4. Y. Wu, P. A. Chou, and K. Jain, "Practical network coding," Technical report, Microsoft Research. In preparation.
5. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Information Theory, IT-46(4):1204-1216, Jul. 2000.
6. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," 51st Allerton Conf. Comm., Control and Comp., Oct. 2003.