On the multiple unicast network coding, conjecture

Michael Langberg, Muriel Medard
2009 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
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.
doi:10.1109/allerton.2009.5394800 fatcat:7v7bebc6drgzbfduqhyf6xtqxy