Network coding is highly non-approximable

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 209-213

  Yao, Hongyi ^a   Verbin, Elad ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL NETWORKS; HARD PROBLEMS; HARDNESS RESULT; INAPPROXIMABILITY; LARGE N; LINEAR CODES; MULTIPLICATIVE FACTORS; NETWORK CODING; NP-HARD;

COMPUTATIONAL COMPLEXITY; HARDNESS; OPTIMIZATION;

INFORMATION THEORY;

EID: 77949623945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394818     Document Type: Conference Paper

References (13)

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. P. Berman and G. Schnitger. On the complexity of approximating the independent set problem. Information and Computation, 96(1):77-94, 1992.
3. P. A. Chou, Y. Wu, and K. Jain. Practical network coding. In Proc. of Allerton Conference on Communication, Control, and Computing, 2003.
4. R. Diestel. Graph Theory. Springer, 2005.
5. R. Dougherty, C. Freiling, , and K. Zeger. Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory, 8:2745-2759, 2005.
6. 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, 51(6):1973-1982, 2003.
7. M. Langberg and A. Sprintson. On the hardness of approximating the network coding capacity. In Proc. of ISIT, 2008.
8. A. R. Lehman and E. Lehman. Complexity classification of network information flow problems. In Proc. of SODA, 2004.
9. Z. Li, B. Li, and L. C. Lau. On achieving maximum multicast throughput in undirected networks. IEEE Transactions on Information Theory, 52(6):2467-2485, 2006.
10. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1993.
11. A. Wigderson. P, NP and mathematics - a computational complexity perspective. In Proc. of ICM 06, volume 1, pages 665-712, 2007.
12. R. W. Yeung. Information Theory and Network Coding. Springer, 2008.
13. R. W. Yeung, S.-Y. Li, and N. Cai. Network Coding Theory. Now Publishers, 2006.