Related references
Note: Only part of the references are listed.An Exact Algorithm for Minimum Vertex Cover Problem
Luzhi Wang et al.
MATHEMATICS (2019)
Approximating the minimum hub cover problem on planar graphs
Belma Yelbay et al.
OPTIMIZATION LETTERS (2016)
SPLIT VERTEX DELETION meets VERTEX COVER: New fixed-parameter and exact exponential-time algorithms
Marek Cygan et al.
INFORMATION PROCESSING LETTERS (2013)
Vertex cover might be hard to approximate to within 2-ε
Subhash Khot et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2008)
On the hardness of approximating minimum vertex cover
I Dinur et al.
ANNALS OF MATHEMATICS (2005)
Share Paper
