Blogger

Delete comment from: Computational Complexity

Anonymous said...

The problem is APX-hard, as proved in https://doi.org/10.1016/S0304-3975(98)00158-3

A more detailed, but not updated, discussion is at https://www.csc.kth.se/~viggo/wwwcompendium/node10.html

Sep 27, 2022, 1:52:45 AM


Posted to Is the complexity of approximating Vertex Cover of degree 3 open? (ADDED LATER-NO)

Google apps
Main menu