Multicasting in Linear Deterministic Relay Network by Matrix Completion
Multicasting in Linear Deterministic Relay Network by Matrix Completion
复制标题
线性确定性中继网络中矩阵补全的组播
DOI：
10.1109/tit.2015.2509240
复制
发表时间：
2016
影响因子：
2.5
通讯作者：
Tasuku Soma
中科院分区：
文献类型：
--
作者：
宇賀神知紀;Tasuku Soma
我们提供了一种用于线性确定性中继网络中多播的确定性多项式时间算法以及 Avestimehr 等人提出的无线通信框架。我们算法的运行时间比现有算法更快，并且与每个接收器单播计算的当前最佳复杂度相匹配。我们的方法基于 Goemans 等人的多链接流模型。以及 Harvey 等人的混合矩阵完成技术。
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.