1 paper
Majid Zohrehbandian
The vertex cover problem is a famous combinatorial problem, and its complexity has been heavily studied. While a 2-approximation can be trivially obtained for it, researchers have…