255 search results - page 3 / 51 » A Local 2-Approximation Algorithm for the Vertex Cover Probl... |
130
Voted
WADS
2005
Springer
15 years 7 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
122
Voted
ORL
1998
15 years 2 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
67
Voted
JCSS
2006
15 years 2 months ago
2006
147
click to vote
IICAI
2003
15 years 3 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
141
click to vote
IPL
2010
14 years 9 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...