102 search results - page 1 / 21 » A Stochastic Local Search Approach to Vertex Cover |
KI
2007
Springer
14 years 5 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
CONSTRAINTS
2007
13 years 11 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
EPS
1998
Springer
14 years 3 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 ...
ESA
2007
Springer
14 years 5 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
JAIR
2006
13 years 11 months ago
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...