Complexity Classification of Network Information Flow Problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 135-143

  Lehman, April Rasala ^a   Lehman, Eric ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK INFORMATION; NONLINEAR CODING;

ALGORITHMS; BROADCASTING; COMPUTATIONAL METHODS; FUNCTIONS; GRAPH THEORY; INFORMATION ANALYSIS; MULTICASTING; POLYNOMIALS;

PROBLEM SOLVING;

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

References (7)

1. Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, and Raymond W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204-1216, July 2000.
2. Pavol Hell and Jaroslav Nešetřil. On the complexity of h-coloring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990.
3. Tracey Ho, David Karger, Muriel Médard, and Ralf Koetter. Network coding from a network flow perspective. In IEEE International Symposium on Information Theory, 2003.
4. Ralf Koetter and Muriel Médard. Beyond routing: An algebraic approach to network coding. In INFO-COM, 2002.
5. Ralf Koetter and Muriel Médard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking, To Appear.
6. Shuo-Yen Robert Li, Raymond W. Yeung, and Ning Cai. Linear network coding. IEEE/ACM Transactions on Information Theory, 49:371-381, 2003.
7. Peter Sanders, Sebastian Egner, and Ludo Tolhuizen. Polynomial time algorithms for network information flow.