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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
