On the hardness of approximating the network coding capacity

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 1008-1014

  Langberg, Michael ^a   Sprintson, Alex ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b Texas AandM University   (United States)

Author keywords

Approximation; capacity; complexity; index coding; network coding

Indexed keywords

APPROXIMATION; CAPACITY; COMPLEXITY; INDEX CODING; NETWORK CODING;

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY;

ENCODING (SYMBOLS);

EID: 79251507985     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2094910     Document Type: Article

References (38)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, 2003.
3. R.Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 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 Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 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 Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, 2006. (Pubitemid 46445282)
6. T. Cover and J. Thomas, Elements of Information Theory, 2nd ed. New York: Wiley, 2006.
7. R. W. Yeung, S. Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory. New York: Now, 2006.
8. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, 2005. (Pubitemid 41158597)
9. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Commun., Contr. Comput., Monticello, IL, Oct. 2003.
10. A. L. Rasala, "Network Coding," Ph.D. Thesis, Dep. Elect. Eng. Comput. Sci., Mass. Instit. Technol., Cambridge, 2005.
11. A. L. Rasala and E. Lehman, "Complexity classification of network information flow problems," in Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), New Orleans, LA, Jan. 2004.
12. M. Médard, M. Effros, T. Ho, and D. Karger, "On coding for nonmulticast networks," in Proc. 41st Ann. Allerton Conf. Commun. Contr. Comput., Monticello, IL, 2003.
13. R. Dougherty, C. Freiling, and K. Zeger, "Networks, matroids, and non-Shannon information inequalities," IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 1949-1969, 2007.
14. 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), Miami, FL, Jan. 2006, pp. 2345-2364.
15. N. J. A. Harvey, R. D. Kleinberg, and A. L. Rasala, "On the capacity of information networks," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2345-2364, 2006.
16. R. W. Yeung, A First Course in Information Theory. New York: Springer (Kluwer Academic/Plenum), 2002.
17. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, "Network coding theory," in Foundations and Trends in Communications and Information Theory. New York: Now, 2006.
18. T. Chan and A. Grant, "Dualities between entropy functions and network codes," IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4470-4487, 2008.
19. M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity," in Proc. Int. Symp. Inf. Theory (ISIT), Toronto, Canada, Jul. 2008, pp. 315-319.
20. H. Yao and E. Verbin, "Network coding is highly non-approximable, " in Proc. 47th Ann. Allerton Conf, Commun., Contr. Comput., Monticello, IL, Sep.-Oct. 2009.
21. M. Halldorsson, "A still better performance guarantee for approximate graph coloring," Inf. Process. Lett., vol. 45, pp. 19-23, 1993.
22. D. Zuckerman, "Linear degree extractors and the inapproximability of max clique and chromatic number," in Proc. 38th Ann. ACM Symp. Theory of Comput., Miami, FL, Jan. 2006.
23. D. Karger, R. Motwani, and M. Sudan, "Approximate graph coloring by semidefinite programming," J. ACM, vol. 45, no. 2, pp. 246-265, 1998.
24. A. Blum and D. Karger, "An-coloring for 3-colorable graphs," Inf. Process. Lett., vol. 61, no. 6, pp. 49-53, 1997.
25. E. Halperin, R. Nathaniel, and U. Zwick, "Coloring k-colorable graphs using smaller palettes," J. Algorithms, vol. 45, pp. 72-90, 2002.
26. S. Arora, E. Chlamtac, and M. Charikar, "New approximation guarantee for chromatic number," in Proc. 38th Ann. ACM Symp. Theory of Comput., Seattle, WA, May 2006.
27. S. Khanna, N. Linial, and S. Safra, "On the hardness of approximating the chromatic number," Combinatorica, vol. 20, pp. 393-415, 2000.
28. V. Guruswami and S. Khanna, "On the hardness of 4-coloring a 3-colorable graph," in Proc. 15th Ann. IEEE Conf. Computat. Complex., Florence, Italy, Jul. 2000.
29. S. Khot, "On the power of unique 2-prover 1-round games," in Proc. 34th Ann. ACM Symp. Theory of Comput. (STOC), Montreal, Quebec, Canada, May 2002.
30. I. Dinur, E. Mossel, and O. Regev, "Conditional hardness for approximate coloring," in Proc. 38th ACM Symp. Theory of Comput., Seattle, WA, May 2006.
31. B. S. Baker, "Approximation algorithms for NP-complete problems on planar graphs," J. ACM, vol. 41, no. 1, pp. 153-180, 1994.
32. Z. Li and B. Li, "Network coding: The case for multiple unicast sessions," in Proc. 42nd Ann. Allerton Conf. Commun. Contr. Comput., Monticello, IL, 2004.
33. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol, "Index coding with side information," in Proc. 47th Ann. IEEE Symp. Found. Comput. Sci. (FOCS), Berkeley, CA, Oct. 2006.
34. E. Lubetzky and U. Stav, "Non-linear index coding outperforming the linear optimum," in Proc. 48th Ann. IEEE Symp. Found. Comput. Sci. (FOCS), Providence, RI, Oct. 2007.
35. S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
36. N. Alon, E. Lubetzky, U. Stav, A.Weinstein, and A. Hassidim, "Broadcasting with side information," in Proc. 49th Ann. IEEE Symp. Found. Comput. Sci., Philadelphia, PA, Oct. 2008.
37. W. H. Haemers, "On some problems of Lovász concerning the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. 25, no. 2, pp. 231-232, 1979.
38. R. Peeters, "Orthogonal representations over finite fields and the chromatic number of graphs," Combinatorica, vol. 16, no. 3, pp. 417-431, 1996. (Pubitemid 126353017)