TY - GEN
T1 - On the multiple unicast network coding conjecture
AU - Langberg, Michael
AU - Médard, Muriel
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77949642181&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2009.5394800
DO - 10.1109/ALLERTON.2009.5394800
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77949642181
SN - 9781424458714
T3 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
SP - 222
EP - 227
BT - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
T2 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Y2 - 30 September 2009 through 2 October 2009
ER -