Deterministic network coding by matrix completion

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 489-498

  Harvey, Nicholas J A ^a   Karger, David R ^a   Murota, Kazuo ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; NETWORK CODES; NETWORK INFORMATION FLOW PROBLEM; PSEUDOCODES;

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

ENCODING (SYMBOLS);

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

References (19)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204-1216, 2000.
2. M. Berdan. A matrix rank problem. Unpublished manuscript, 2003.
3. W. H. Cunningham. Improved bounds for matroid partition and intersection algorithms. SIAM Journal on Computing, 15(4):948-957, Nov 1986.
4. S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111-121, 1980.
5. S. Fujishige. Submodular Functions and Optimization, volume 47 of Annals of Discrete Mathematics. North-Holland, 1991.
6. H. N. Gabow and Y. Xu. Efficient theoretic and practical algorithms for linear matroid intersection problems. Journal of Computer and System Sciences, 53(1):129-147, 1996.
7. J. F. Geelen. Maximum rank matrix completion. Linear Algebra and its Applications, 288:211-217, 1999.
8. J. F. Geelen. Matching theory. Unpublished manuscript, 2001.
9. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman. Comparing network coding with multicommodity flow for the k-pairs communication problem. Technical Report MIT-LCS-TR-964, Massachusetts Institute of Technology, Sept. 2004.
10. T. Ho, D. R. Karger, M. Médard, and R. Koetter. Network coding from a network flow perspective. In Proceedings of the IEEE International Symposium on Information Theory, 2003.
11. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, The benefits of coding over routing in a randomized setting. In Proceedings of the IEEE International Symposium on Information Theory, 2003.
12. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory. Submitted July 2003.
13. R. Koetter and M. Médard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking. To appear.
14. M. Laurent. Matrix completion problems. In C. Floudas and P. Pardalos, editors, The Encyclopedia of Optimization, volume III, pages 221-229. Kluwer, 2001.
15. A. R. Lehman and E. Lehman. Complexity classification of network information flow problems. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Jan 2004.
16. S.-Y. R. Li, R. Yeung, and N. Cai. Linear network coding. IEEE Transactions on Information Theory, 49(2), 2003.
17. L. Lovász. On determinants, matchings and random algorithms. In L. Budach, editor, Fundamentals of Computation Theory, FCT '79. Akademie-Verlag, Berlin, 1979.
18. K. Murota. Matrices and Matroids for Systems Analysis. Springer-Verlag, 2000.
19. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, 2003.