Multicasting in Linear Deterministic Relay Network by Matrix Completion

Abstract

We provide a deterministic polynomial time algorithm for multicasting in a linear deterministic relay network and a wireless communication framework proposed by Avestimehr et al. The running time of our algorithm is faster than existing ones and matches the current best complexity of unicast computations for each sink. Our approach is based on the polylinking flow model of Goemans et al. and the mixed matrix completion technique of Harvey et al.