New approximation algorithms for the vertex cover problem
F Delbot, C Laforest, R Phan - … , IWOCA 2013, Rouen, France, July 10-12 …, 2013 - Springer
The vertex cover is a classical NP-complete problem that has received great attention these
last decades. A conjecture states that there is no c-approximation polynomial algorithm for it …
last decades. A conjecture states that there is no c-approximation polynomial algorithm for it …
[PDF][PDF] A polynomial-time algorithm to obtain bounds for the vertex cover number
R Dharmarajana, D Ramachandrana… - researchgate.net
In any attempt at designing an efficient algorithm for the minimum vertex cover problem,
obtaining good upper and lower bounds for the vertex cover number could be crucial. In this …
obtaining good upper and lower bounds for the vertex cover number could be crucial. In this …
A modified greedy algorithm to improve bounds for the vertex cover number
R Dharmarajan, D Ramachandran - arXiv preprint arXiv:1901.00626, 2019 - arxiv.org
In any attempt at designing an efficient algorithm for the minimum vertex cover problem,
obtaining good upper and lower bounds for the vertex cover number could be crucial. In this …
obtaining good upper and lower bounds for the vertex cover number could be crucial. In this …