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

容量约束网络设计的逼近性

Approximability of Capacitated Network Design

Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula

摘要:

在{ \em capacitated}抗毁网络设计问题(Cap-SNDP)中,我们给出了一个无向多重图,其中每条边都有一个容量和一个代价.我们的目标是找到一个最小的成本子集的边缘,满足一组给定的成对最小切割的要求。不像它的经典特殊情况SNDP时,所有的能力是单位,Cap-SNDP的可近似性还没有得到很好的理解,即使在非常有限的设置没有已知的算法实现了$o(m)$近似,其中$m$是在图中的边缘的数量。在本文中,我们得到了几个新的结果和见解Cap-SNDP的逼近。

英文摘要:

In the {\em capacitated} survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimum-cut requirements. Unlike its classical special case of SNDP when all capacities are unit, the approximability of Cap-SNDP is not well understood; even in very restricted settings no known algorithm achieves a $o(m)$ approximation, where $m$ is the number of edges in the graph. In this paper, we obtain several new results and insights into the approximability of Cap-SNDP.

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

↑