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

连通因子的可逼近性

Approximability of Connected Factors

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul

摘要:

图的d-正则生成子图(或d-因子)的求法很容易通过Tutte对匹配问题的约化而得到。通过同样的约简,很容易找到一个图的最小或最大d-因子。然而,如果我们要求d-因子是连通的,这些问题就变成了NP-难的--找到一个最小连通的2-因子就是旅行商问题(TSP)。给定一个边权满足三角不等式的完全图,考虑求最小连通$d$ -因子的问题。我们给出了所有$d$的3-近似,并将其改进为偶数d的(r+1)-近似,其中r是TSP的近似比。这产生了偶数d的2.5近似。同样的算法产生一个(r+1)-近似的有向版本的问题,其中r是近似比的非对称TSP。我们还表明,没有这些最小化问题可以近似比相应的TSP。最后,对于判定给定图是否包含连通d-因子的判定问题,我们推广了已知的硬度结果。

英文摘要:

Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the d-factor is connected, these problems become NP-hard - finding a minimal connected 2-factor is just the traveling salesman problem (TSP). Given a complete graph with edge weights that satisfy the triangle inequality, we consider the problem of finding a minimal connected $d$-factor. We give a 3-approximation for all $d$ and improve this to an (r+1)-approximation for even d, where r is the approximation ratio of the TSP. This yields a 2.5-approximation for even d. The same algorithm yields an (r+1)-approximation for the directed version of the problem, where r is the approximation ratio of the asymmetric TSP. We also show that none of these minimization problems can be approximated better than the corresponding TSP. Finally, for the decision problem of deciding whether a given graph contains a connected d-factor, we extend known hardness results.

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

↑