arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.3054cs.DS
收藏

非均匀硬容量k-中心的LP舍入

LP Rounding for k-Centers with Non-uniform Hard Capacities

Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller

摘要:

在本文中,我们考虑一个推广的经典k-中心问题的能力。我们的目标是在图中选择k个中心,并将每个节点分配给附近的中心,以便我们尊重中心的容量约束。目标是最小化节点到达指定中心所需的最大距离。这个问题是NP难的,即使中心没有容量限制和最佳因子2近似算法是已知的。对于容量,当所有中心具有相同的容量时,已知6近似没有比无限容量版本更好的下限。虽然这个问题的许多概括和变化已被广泛研究,没有取得任何进展的能力版本的一般能力功能。我们发展了第一常数因子近似算法。我们的算法使用LP舍入的方法来解决这个问题,并适用于非均匀的硬容量的情况下,当一个节点的多个副本可能不会被选择,并可以扩展到的情况下,当有一个硬约束的副本的数量可以选择的节点。此外,我们为非均匀(均匀)硬容量建立了完整性差距的下限7(5)。此外,我们证明了,如果有一个(3-eps)-因子逼近这个问题,那么P=NP。最后,对于非均匀的软容量,我们提出了一个简单得多的11-近似算法,我们发现作为一个证据,硬容量更难处理。

英文摘要:

In this paper we consider a generalization of the classical k-center problem with capacities. Our goal is to select k centers in a graph, and assign each node to a nearby center, so that we respect the capacity constraints on centers. The objective is to minimize the maximum distance a node has to travel to get to its assigned center. This problem is NP-hard, even when centers have no capacity restrictions and optimal factor 2 approximation algorithms are known. With capacities, when all centers have identical capacities, a 6 approximation is known with no better lower bounds than for the infinite capacity version. While many generalizations and variations of this problem have been studied extensively, no progress was made on the capacitated version for a general capacity function. We develop the first constant factor approximation algorithm for this problem. Our algorithm uses an LP rounding approach to solve this problem, and works for the case of non-uniform hard capacities, when multiple copies of a node may not be chosen and can be extended to the case when there is a hard bound on the number of copies of a node that may be selected. In addition we establish a lower bound on the integrality gap of 7(5) for non-uniform (uniform) hard capacities. In addition we prove that if there is a (3-eps)-factor approximation for this problem then P=NP. Finally, for non-uniform soft capacities we present a much simpler 11-approximation algorithm, which we find as one more evidence that hard capacities are much harder to deal with.

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

↑