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

具有k个终端的最小费用2-连通子图

Min-Cost 2-Connected Subgraphs With k Terminals

Chandra Chekuri, Nitish Korula

摘要:

在k-2 VC问题中,我们给定一个具有边代价和整数k的无向图G,目标是找到G的一个最小代价2-顶点连通子图,该子图至少包含k个顶点。如果输入还指定终端的子集S \subseteq V,并且目标是找到包含至少k个终端的子图,则获得稍微更一般的版本。与k-2 VC问题密切相关的是k-2 EC问题,其目标是找到一个包含k个顶点的最小代价2-边连通子图。k-2 EC问题是由Lau等人提出的,他也给出了一个多对数近似。没有以前的近似算法是已知的更一般的k-2 VC问题。我们描述了一个O(\log n \log k)的k-2 VC问题的近似。

英文摘要:

In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S \subseteq V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which the goal is to find a minimum-cost 2-edge-connected subgraph containing k vertices. The k-2EC problem was introduced by Lau et al., who also gave a poly-logarithmic approximation for it. No previous approximation algorithm was known for the more general k-2VC problem. We describe an O(\log n \log k) approximation for the k-2VC problem.

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

↑