158 search results - page 29 / 32 » Evolutionary algorithms and the Vertex Cover problem |
SYNASC
2005
IEEE
15 years 3 months ago
2005
IEEE
The aim of this work is to analyze the applicability of crowding differential evolution to unsupervised clustering. The basic idea of this approach, interpreting the clustering pr...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-ob...
FSTTCS
2009
Springer
15 years 2 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
JSAT
2010
14 years 4 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...