Delete comment from: Computational Complexity
If one begins the reduction of the above-mentioned Thm 2.4 from Max 3SAT where each variable occurs a bounded number of times, the same reduction probably establishes APX-hardness with a more careful soundness argument?
Sep 27, 2022, 1:19:06 AM
Posted to Is the complexity of approximating Vertex Cover of degree 3 open? (ADDED LATER-NO)