Multicasting in linear deterministic relay network by matrix completion

Abstract

We provide a faster deterministic polynomial time algorithm for multicasting in a linear deterministic relay network, a wireless communication framework proposed by Avestimehr, Diggavi and Tse (2011). The running time of our algorithm matches the current best complexity of unicast computations for each sink. Our approach is based on the polylinking flow model of Goemans, Iwata and Zenklusen (2012), and the mixed matrix completion technique of Harvey, Karger and Murota (2005).