Computing bounds on network capacity regions as a polytope reconstruction problem

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 588-592

  Kim, Anthony ^a   Medard, Muriel ^b  

^a ORACLE CORPORATION   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; CAPACITY REGIONS; CLOSEDNESS; COMBINATORIAL OPTIMIZATION PROBLEMS; EXACT ALGORITHMS; FINITE FIELDS; LINEAR CODING; MINIMUM COST; NETWORK CAPACITY; NETWORK CAPACITY REGION; POLYNOMIAL-TIME; POLYTOPES; RECONSTRUCTION PROBLEMS; STEINER TREE PROBLEM;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONCRETE BEAMS AND GIRDERS; FINITE ELEMENT METHOD; INFORMATION THEORY; TREES (MATHEMATICS);

NETWORK CODING;

EID: 80054817999     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034197     Document Type: Conference Paper

References (17)

1. R. Ahlswede, N. Cai, S.-Y. Li, and R. Yeung, "Network information flow", Information Theory, IEEE Transactions on, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman, "On the capacity of information networks", IEEE/ACM Trans. Netw., vol. 14, no. SI, pp. 2345-2364, 2006.
3. X. Yan, J. Yang, and Z. Zhang, "An outer bound for multisource multisink network coding with minimum cost consideration", IEEE/ACM Trans. Netw., vol. 14, no. SI, pp. 2373-2385, 2006.
4. S. Thakor, A. Grant, and T. Chan, "Network coding capacity: A functional dependence bound", in Information Theory, 2009. ISIT 2009. IEEE International Symposium on, june 2009, pp. 263-267.
5. X. Yan, R. W. Yeung, and Z. Zhang, "The capacity region for multisource multi-sink network coding", in Information Theory, 2007. ISIT 2007. IEEE International Symposium on, 24-29 2007, pp. 116-120.
6. T. Chan and A. Grant, "Mission impossible: Computing the network coding capacity region", in Information Theory, 2008. ISIT 2008. IEEE International Symposium on, 6-11 2008, pp. 320-324.
7. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity", in Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on, 4-9 2005, pp. 11-13.
8. S. M. S. T. Yazdi, S. A. Savari, F. Farnoud, and G. Kramer, "A multimessage capacity region for undirected ring networks", in Information Theory, 2007. ISIT 2007. IEEE International Symposium on, 24-29 2007, pp. 1091-1095.
9. S. Yazdi, S. Savari, K. Carlson, and G. Kramer, "The capacity region of a collection of multicast sessions in an undirected ring network", in Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on, 10-14 2007, pp. 40-40.
10. A. Kakhbod and S. M. S. T. Yazdi, "On describing the routing capacity regions of networks", Mathematical Methods of Operations Research, pp. 1432-2994, May 2010.
11. A. Kim, "On network coding capacity - matroidal networks and network capacity regions", Master's thesis, MIT, Cambridge, MA 02139, Sept. 2010, available at http://www.mit.edu/?tonyekim/. Also at arXiv.
12. R. Cole and C. K. Yap, "Shape from probing", J. Algorithms, vol. 8, no. 1, pp. 19-38, 1987.
13. P. Gritzmann, V. Klee, and J. Westwater, "Polytope Containment and Determination by Linear Probes", Proc. London Math. Soc., vol. s3-70, no. 3, pp. 691-720, 1995.
14. N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems", SIAM Journal on Computing, vol. 37, no. 2, pp. 630-652, 2007.
15. M. Charikar, C. Chekuri, T.-y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed steiner problems", in SODA'98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1998, pp. 192-200.
16. L. Fleischer, "A fast approximation scheme for fractional covering problems with variable upper bounds", in SODA'04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2004, pp. 1001-1010.
17. 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, pp. 142-150.