arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1102.3393cs.DS
收藏

二部图中增量频率分配的最佳界

Better Bounds for Incremental Frequency Allocation in Bipartite Graphs

Marek Chrobak, Łukasz Jeż, Jiří Sgall

摘要:

我们研究无线网络中的频率分配。无线网络由无向图建模,顶点对应于小区。在每个顶点中,我们有一定数量的请求,并且每个请求必须被分配不同的频率。边表示单元之间的冲突,这意味着相邻顶点的频率也必须不同。目标是最小化使用频率的总数。这个问题的离线版本被认为是NP难的。在增量版本中,对频率的请求随着时间的推移而到达,并且算法需要在请求到达时立即为其分配频率。竞争增量算法已经研究了几类图。对于路径,最佳(渐近)比已知为4/3,而对于六边形单元图,它在1.5和1.9126之间。对于k-可着色图,可以达到(k+1)/2的比例。本文证明了二部图的渐近竞争比的近似紧界,它在1.428和1.433之间。这改进了之前的4/3下限和1.5上限。我们的证明是基于减少增量问题的一个纯粹的组合(等价)的问题,构建具有一定的交叉属性的集合家庭。

英文摘要:

We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain number of requests, and each of those requests must be assigned a different frequency. Edges represent conflicts between cells, meaning that frequencies in adjacent vertices must be different as well. The objective is to minimize the total number of used frequencies. The offline version of the problem is known to be NP-hard. In the incremental version, requests for frequencies arrive over time and the algorithm is required to assign a frequency to a request as soon as it arrives. Competitive incremental algorithms have been studied for several classes of graphs. For paths, the optimal (asymptotic) ratio is known to be 4/3, while for hexagonal-cell graphs it is between 1.5 and 1.9126. For k-colorable graphs, the ratio of (k+1)/2 can be achieved. In this paper, we prove nearly tight bounds on the asymptotic competitive ratio for bipartite graphs, showing that it is between 1.428 and 1.433. This improves the previous lower bound of 4/3 and upper bound of 1.5. Our proofs are based on reducing the incremental problem to a purely combinatorial (equivalent) problem of constructing set families with certain intersection properties.

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

↑