Tighter cut-based bounds for k-pairs communication problems

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 4, Issue , 2005, Pages 2053-2062

  Harvey, Nicholas J A ^a   Kleinberg, Robert ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (13)

1. M. Adler, N. J. A. Harvey, K. Jain, R. Kleinberg, and A. R. Lehman. On the capacity of information networks. To appear in the ACM-SIAM Symposium on Discrete Algorithms, 2006.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information ow. IEEE Transactions on Information Theory, 46(4):1204-1216, July 2000.
3. S. P. Borade. Network information ow: Limits and achievability. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2002.
4. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
5. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman. On the capacity of information networks. Sub-mitted to the the special issue of the IEEE Transactions on Information Theory and the IEEE/ACM Transactions on Networking on Networking and Information Theory.
6. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman. Comparing network coding with multi-commodity ow for the k-pairs communication problem. Technical Report 964, MIT LCS, Sept. 2004.
7. K. Jain, V. Vazirani, R. W. Yeung, and G. Yuval. On the capacity of multiple unicast sessions in undirected graphs. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Sept. 2005.
8. J. Kleinberg. Personal communication, May 2005.
9. G. Kramer and S. Savari. Progressive d-separating edge set bounds on network coding rates. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Sept. 2005.
10. G. Kramer and S. A. Savari. On networks of two-way channels. In Proceedings of the DIMACS Workshop on Algebraic Coding Theory and Information Theory, Dec. 2003. To appear.
11. Z. Li and B. Li. Network coding: The case of multiple unicast sessions. In Proceedings of the 42nd Allerton Annual Conference on Communication, Control, and Computing, 2004.
12. L. Song, R. Yeung, and N. Cai. Zero-error network coding for acyclic networks. IEEE Transactions on Information Theory, 49:3129-3139, Dec. 2003.
13. V. Vazirani. Approximation Algorithms. Springer, 2001.