arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.1917cs.DMmath.CO
收藏

k-边连通性:逼近与LP松弛

k-Edge-Connectivity: Approximation and LP Relaxation

David Pritchard

摘要:

在k-边连通生成子图问题中,我们给定一个图(V,E)和每条边的代价,并希望找到E的最小代价子集F,使得(V,F)是k-边连通的。我们证明了存在一个常数eps > 0,因此对于所有k > 1,找到k-ECSS的(1 + eps)近似是NP困难的,在单位成本和一般成本版本之间建立了一个差距。接下来,我们考虑k-ECSS的多子图表亲,其中我们购买E的多子集F,以与原始边相同的成本提供无限的并行副本。我们猜想存在一个(1 + Theta(1/k))-近似算法,并描述了一种基于图分解的自然线性规划(LP)松弛方法。该LP基本上等价于TSP的Held-Karp LP和Steiner树的无向LP。我们给出了一个家庭的极端点的LP是比以前已知的更复杂。

英文摘要:

In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost subset F of E such that (V, F) is k-edge-connected. We show there is a constant eps > 0 so that for all k > 1, finding a (1 + eps)-approximation for k-ECSS is NP-hard, establishing a gap between the unit-cost and general-cost versions. Next, we consider the multi-subgraph cousin of k-ECSS, in which we purchase a multi-subset F of E, with unlimited parallel copies available at the same cost as the original edge. We conjecture that a (1 + Theta(1/k))-approximation algorithm exists, and we describe an approach based on graph decompositions applied to its natural linear programming (LP) relaxation. The LP is essentially equivalent to the Held-Karp LP for TSP and the undirected LP for Steiner tree. We give a family of extreme points for the LP which are more complex than those previously known.

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

↑