We study the cooperative data exchange problem for fully connected networks. In this problem, nodes make broadcast transmissions to recover a file consisting of KK independent packets. Each node initially only possesses a subset of the packets. We propose (d,K)(d,K) -Basis Searching, a deterministic polynomial-time minimization approach, to calculate the minimum rate for this problem. (d,K)(d,K) -Basis Searching has strictly reduced complexity compared with the state-of-the-art algorithms, which are based on submodular function minimization. We extend our algorithm to a generalized problem: the so-called successive local omniscience problem.

中文翻译：

---

全连接网络协作数据交换问题最小速率的计算


我们研究全连接网络的协作数据交换问题。在此问题中，节点进行广播传输来恢复由 KK 独立数据包组成的文件。每个节点最初仅拥有数据包的一个子集。我们提出（d，K）（d，K）-基础搜索，一种确定性多项式时间最小化方法，来计算该问题的最小速率。 (d,K)(d,K) - 与基于子模函数最小化的最先进算法相比，基础搜索严格降低了复杂性。我们将算法扩展到广义问题：所谓的连续局部全知问题。