1486 search results - page 16 / 298 » Algorithms for two-box covering |
FAW
2008
Springer
13 years 9 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
EPS
1998
Springer
13 years 11 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
COCOON
2004
Springer
14 years 23 days ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
IICAI
2003
13 years 8 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. ...