arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.08382cs.DScs.ITmath.IT
收藏

索引编码的改进近似算法

Improved Approximation Algorithms for Index Coding

Dror Chawin, Ishay Haviv

AI总结:

该研究提出索引编码速率近似的通用方法,改进了图与有向图及拟线图的近似因子,且方法可推广至多种图与有向图参量的近似。

摘要:

索引编码问题研究如何向一组接收者广播编码信息,使得每个接收者能够基于自身的边信息(即其他部分接收者所需的数据)获取其所需数据。给定边信息映射(对称情形下用图表示,非对称情形下用有向图表示),研究目标是设计出广播长度最小的编码方案。\n 我们提出了一种通用方法,用于开发针对指定实例族的索引编码速率近似高效算法。作为应用,我们得到了多项式时间算法,可将n个顶点的图和有向图的索引编码速率分别近似到O(n/log²n)和O(n/log n)的因子范围内。这一结果改进了Blasiak、Kleinberg和Lubetzky(IEEE Trans. Inform. Theory, 2013)取得的图的O(n/log n)、有向图的O(n·log log n/log n)近似因子。对于拟线图族,我们提出了一种多项式时间算法,可将索引编码速率近似到2倍因子范围内。这改进了Arbabjolfaei和Kim(ISIT, 2016)针对取自拟线图某些子族的n顶点图所取得的O(n^(2/3))近似因子。\n 我们的方法还适用于近似多种其他图和有向图参量,且能达到相同的近似因子。具体而言,它适用于所有介于独立数和团覆盖数之间的图参量,以及所有介于无环诱导有向子图的最大规模和有向团覆盖数之间的有向图参量。

英文摘要:

The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its required data based on its side information, which comprises the data required by some of the others. Given the side information map, represented by a graph in the symmetric case and by a digraph otherwise, the goal is to devise a coding scheme of minimum broadcast length. We present a general method for developing efficient algorithms for approximating the index coding rate for prescribed families of instances. As applications, we obtain polynomial-time algorithms that approximate the index coding rate of graphs and digraphs on $n$ vertices to within factors of $O(n/\log^2 n)$ and $O(n/\log n)$ respectively. This improves on the approximation factors of $O(n/\log n)$ for graphs and $O(n \cdot \log \log n/\log n)$ for digraphs achieved by Blasiak, Kleinberg, and Lubetzky (IEEE Trans. Inform. Theory, 2013). For the family of quasi-line graphs, we exhibit a polynomial-time algorithm that approximates the index coding rate to within a factor of $2$. This improves on the approximation factor of $O(n^{2/3})$ achieved by Arbabjolfaei and Kim (ISIT, 2016) for graphs on $n$ vertices taken from certain sub-families of quasi-line graphs. Our approach is applicable for approximating a variety of additional graph and digraph quantities to within the same approximation factors. Specifically, it captures every graph quantity sandwiched between the independence number and the clique cover number and every digraph quantity sandwiched between the maximum size of an acyclic induced sub-digraph and the directed clique cover number.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑