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.
No takes yet. Share an insight, caveat, or question.
Dinur et al. (2005) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: