Analyses of simple hybrid algorithms for the vertex cover problem*

Authors:
Tobias Friedrich;Jun He;Nils Hebbinghaus;Frank Neumann;Carsten Witt
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany, tobias.friedrich@mpi-inf.mpg.de;Department of Computer Science, University of Wales, Aberystwyth, United Kingdom, jqh@aber.ac.uk;Max-Planck-Institut für Informatik, Saarbrücken, Germany, nils.hebbinghaus@mpi-inf.mpg.de;Max-Planck-Institut für Informatik, Saarbrücken, Germany, frank.neumann@mpi-inf.mpg.de;Fakultät für Informatik, LS 2, Technische Universität Dortmund, Dortmund, Germany, carsten.witt@cs.uni-dortmund.de
Venue:
Evolutionary Computation
Year:
2009

Citing 20
Cited 7

Theory of linear and integer programming

Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Approximation algorithms

Approximation algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search

Tabu Search
Evolutionary Algorithms and the Maximum Matching Problem

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Evolutionary Algorithms for Vertex Cover

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

Combinatorics, Probability and Computing
Minimum spanning trees made easier via multi-objective optimization

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the analysis of the (1+1) memetic algorithm

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Maximum cardinality matchings on trees by randomized local search

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Approximating covering problems by randomized search heuristics using multi-objective models

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Speeding up evolutionary algorithms through restricted mutation operators

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A better approximation ratio for the vertex cover problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Worst-case and average-case approximations by simple randomized search heuristics

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Local search in evolutionary algorithms: the impact of the local search frequency

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A relation-algebraic view on evolutionary algorithms for some graph problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Greedy Local Search and Vertex Cover in Sparse Random Graphs

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Fixed-parameter evolutionary algorithms and the vertex cover problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
On the approximation ability of evolutionary optimization with application to minimum set cover

Artificial Intelligence
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs

Theoretical Computer Science
The use of tail inequalities on the probable computational time of randomized search heuristics

Theoretical Computer Science
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms

Proceedings of the 15th annual conference on Genetic and evolutionary computation
On the approximation ability of evolutionary optimization with application to minimum set cover: extended abstract

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast, the theoretical understanding of the interplay of different optimization methods is rare. In this paper, we make a first step into the rigorous analysis of such combinations for combinatorial optimization problems. The subject of our analyses is the vertex cover problem for which several approximation algorithms have been proposed. We point out specific instances where solutions can (or cannot) be improved by the search process of a simple evolutionary algorithm in expected polynomial time.