Conservative network coding

44th Annual Allerton Conference on Communication, Control, and Computing 2006

Volumn 2, Issue , 2006, Pages 792-798

  Harvey, Nicholas J A ^a   Jain, Kamal ^a   Lau, Lap Chi ^a,b   Nair, Chandra ^a   Wu, Yunnan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); NETWORK ROUTING;

ACYCLIC NETWORKS; INDEPENDENT SOURCES; LOSSLESS;

NETWORK CODING;

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

References (10)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
2. J. Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, ser. Courant Computer Science Symposium, R. Rustin, Ed. Algorithmics Press, 1973, vol. 9, pp. 91-96.
3. Y. Wu, K. Jain, and S.-Y. Kung, "A unification of network coding and tree-packing (routing) theorems," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2398-2409, June 2006.
4. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman, "On the capacity of information networks," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2345-2364, June 2006.
5. S. Fortune, J. Hopcroft, and J. Wyllie, "The directed subgraph homeomorphism problem," Theoretical Computer Science, vol. 10, pp. 111-121, 1980.
6. V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis, "Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems," in Proceedings of the ACM Symposium on Theory of Computing, 1999, pp. 19-28.
7. K. Jain, V. V. Vazirani, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2805-2809, June 2006.
8. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," Journal of Network and Systems Management, vol. 14, no. 1, Mar. 2006.
9. P. Hall, "On representatives of subsets," The Journal of the London Mathematical Society, vol. 10, pp. 26-30, 1935.
10. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, 2003.