On the multiple unicast network coding conjecture
Author(s)Langberg, Michael; Medard, Muriel
MetadataShow full item record
In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
47th Annual Allerton Conference on Communication, Control, and Computing, 2009. Allerton 2009
Institute of Electrical and Electronics Engineers
Langberg, M., and M. Medard. “On the multiple unicast network coding, conjecture.” Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on. 2009. 222-227. ©2010 Institute of Electrical and Electronics Engineers.
Final published version
INSPEC Accession Number: 11135244