On the hardness of approximating vertex cover
ANNALS OF MATHEMATICS(2005)
摘要
We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs to develop a new proof framework, and to borrow and extend ideas from several fields.
更多查看译文
关键词
vertex cover,hardness of approximation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络