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

Vertex Cover 问题的 (1.999999)-近似比

A (1.999999)-approximation ratio for vertex cover problem

Majid Zohrehbandian

AI总结:

本文提出基于新半正定规划公式的近似算法,在任意图上实现 1.999999 的性能比,推进了对 unique games conjecture 的研究。

摘要:

Vertex cover problem 是一个著名的组合问题,其复杂性已被广泛研究。虽然可以轻易得到 2-近似,但研究人员一直未能实现优于 2-o(1) 的近似。本文通过引入满足新性质的半正定规划公式,提出了一种近似算法,在任意图上达到 1.999999 的性能比,进而回应了关于 unique games conjecture 正确性的开放问题。

英文摘要:

The vertex cover problem is a famous combinatorial problem, and its complexity has been heavily studied. While a 2-approximation can be trivially obtained for it, researchers have not been able to approximate it better than 2-\textit{o}(1). In this paper, by introducing a new semidefinite programming formulation that satisfies new properties, we introduce an approximation algorithm for the vertex cover problem with a performance ratio of 1.999999 on arbitrary graphs, en route to answering an open question about the correctness of the unique games conjecture.

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

↑