Sciweavers

Share
13 search results - page 1 / 3
» Hybrid evolutionary algorithms on minimum vertex cover for r...
Sort
View
GECCO
2007
Springer
169views Optimization» more  GECCO 2007»
9 years 10 months ago
Hybrid evolutionary algorithms on minimum vertex cover for random graphs
Martin Pelikan, Rajiv Kalapala, Alexander K. Hartm...
CORR
2004
Springer
119views Education» more  CORR 2004»
9 years 3 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
9 years 10 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
9 years 8 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
FCT
2009
Springer
9 years 10 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
books