The Factor-Two Hardness Threshold for Vertex Cover
Minimum Vertex Cover is NP-hard to approximate within every fixed factor with , even on finite simple undirected unweighted graphs; thus, unless , no deterministic polynomial-time algorithm achieves factor for any fixed .
The deduction from Theorem 1.1 to Corollary 1.2 is elementary and rigorously verified in Section 8 using integer arithmetic.
“Corollary 1.2. For every fixed real α with 1 ≤ α < 2, approximating Vertex Cover within factor α is NP-hard. Thus, unless P = NP, no deterministic polynomial-time algorithm achieves factor 2 − ε for any fixed ε ∈ (0, 1].” · Show in paper