On the hardness of approximating the network coding capacity

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 315-319

  Langberg, Michael ^a   Sprintson, Alex ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b Texas A and M University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH COLORINGS; INTERNATIONAL SYMPOSIUM; LINEAR CAPACITY; LINEAR CODING; LINEAR ENCODING FUNCTIONS; LONG STANDING; NETWORK CODING; NP-HARD; OPEN PROBLEMS; PLANAR NETWORKS;

CHLORINE COMPOUNDS; CODES (STANDARDS); CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; CYBERNETICS; GRAPH THEORY; INFORMATION THEORY; NUCLEAR PROPULSION; TECHNICAL PRESENTATIONS;

PROGRAMMING THEORY;

EID: 52349103512     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4594999     Document Type: Conference Paper

References (29)

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. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear Network Coding. IEEE Transactions on Information Theory, 49(2):371-381, 2003.
3. R. Koetter and M. Medard. An Algebraic Approach to Network Coding. IEEE/ACM Transactions on Networking, 11(5):782-795, 2003.
4. 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, June 2005.
5. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong. A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory, 52(10):4413-4430, 2006.
6. T. Cover and J. Thomas. Elements of Information Theory, second edition. John Wiley and Sons, 2006.
7. R. W. Yeung, S.Y.R. Li, N. Cai, and Z. Zhang. Network Coding Theory. Now Publishers Inc, 2006.
8. R. Dougherty, C. Freiling, and K. Zeger. Insufficiency of Linear Coding in Network Information Flow. IEEE Transactions on Information Theory, 51(8):2745-2759, 2005.
9. A. Rasala Lehman. Network Coding. Ph.d. thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2005.
10. A. Lehman and E. Lehman. Complexity Classification of Network Information Flow Problems. In Proceedings of SODA, 2004.
11. M. Adler, N. J. A. Harvey, K. Jain, R. D. Kleinberg, and A. L. Rasala. On the Capacity of Information Networks. In Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), pages 2345-2364, 2006.
12. N. J. A. Harvey, R. D. Kleinberg, and A. Rasala Lehman. On the Capacity of Information Networks. IEEE Transactions on Information Theory, 52(6):23452364, 2006.
13. R. Dougherty, C. Freiling, and K. Zeger. Networks, Matroids, and Non-Shannon Information Inequalities. IEEE Transactions on Information Theory, 53(6):1949-1969, 2007.
14. M. Halldorsson. A Still Better Performance Guarantee for Approximate Graph Coloring. Information Processing Letters, 45:19-23, 1993.
15. D. Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. In Proceedings of the 38th annual ACM symposium on Theory of Computing, pages 681-690, 2006.
16. D. Karger, R. Motwani, and M. Sudan. Approximate Graph Coloring by Semidefinite Programming. Journal of ACM, 45(2):246-265, 1998.
17. 3/14)-coloring for 3-colorable Graphs. Information Processing Letters, 61(6):49-53, 1997.
18. E. Halperin, R. Nathaniel, and U. Zwick. Coloring k-colorable graphs using smaller palettes. Journal of Algorithms, 45:72-90, 2002.
19. S. Arora, E. Chlamtac, and M. Charikar. New Approximation Guarentee for Chromatic Number. In proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 215-224, 2006.
20. S. Khanna, N. Linial, and S. Safra. On the Hardness of Approximating the Chromatic Number. Combinatorica, 20:393-415, 2000.
21. V. Guruswami and S. Khanna. On the Hardness of 4-coloring a 3-colorable Graph. Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 188-197, 2000.
22. S. Khot. On the Power of Unique 2-prover 1-round Games. In Proceedings of the 34th annual ACM symposium on Theoiy of computing, pages 767-775, 2002.
23. I. Dinur, E. Mossel, and O. Regev. Conditional Hardness for Approximate Coloring. In Proceedings of 38th ACM Symposium on Theoiy of Computing, pages 344-353, 2006.
24. B. S. Baker. Approximation Algorithms for NP-complete Problems on Planar Graphs. J. ACM, 41(1):153-180, 1994.
25. Z. Li and B. Li. Network Coding: The Case for Multiple Unicast Sessions, 2004.
26. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol. Index Coding with Side Information. In Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science, pages 197-206, 2006.
27. E. Lubetzky and U. Stav. Non-linear Index Coding Outperforming the Linear Optimum. In Proceedings of 48th Annual IEEE Symposium on Foundations of Computer Science, pages 161-168, 2007.
28. W. H. Haemersl. On Some Problems of Lovász Concerning the Shannon Capacity of a Graph. IEEE Transactions on Information Theory, 25(2):231-232, 1979.
29. R. Peeters. Orthogonal Representations Over Finite Fields and the Chromatic Number of Graphs. Combinatorica, 16(3):417-431, 1996.