The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
Drift analysis and average time complexity of evolutionary algorithms
Artificial Intelligence
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Fitness Landscapes Based on Sorting and Shortest Paths Problems
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Theoretical Aspects of Evolutionary Algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Rigorous runtime analysis of a (μ+1)ES for the sphere function
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Evolutionary Computation
Probabilistic runtime analysis of (1 +, λ),ES using isotropic mutations
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
How the (1 + 1) ES using isotropic mutations minimizes positive definite quadratic forms
Theoretical Computer Science - Foundations of genetic algorithms
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
Theoretical Computer Science
On the runtime analysis of the 1-ANT ACO algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Do additional objectives make a problem harder?
Proceedings of the 9th 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
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Rigorous analyses of simple diversity mechanisms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Speeding up evolutionary algorithms through asymmetric mutation operators
Evolutionary Computation
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
Computers and Operations Research
Computational complexity and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Runtime analysis of binary PSO
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computing minimum cuts by randomized search heuristics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Memetic algorithms with variable-depth search to overcome local optima
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Theoretical analysis of diversity mechanisms for global exploration
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Analyses of simple hybrid algorithms for the vertex cover problem*
Evolutionary Computation
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science
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
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Theoretical analysis of fitness-proportional selection: landscapes and efficiency
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
On the effects of adding objectives to plateau functions
IEEE Transactions on Evolutionary Computation
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Analysis of a simple evolutionary algorithm for minimization in euclidean spaces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Drift analysis with tail bounds
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
More effective crossover operators for the all-pairs shortest path problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science
Free lunches on the discrete Lipschitz class
Theoretical Computer Science
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Revisiting the restricted growth function genetic algorithm for grouping problems
Evolutionary Computation
Speeding up evolutionary algorithms through restricted mutation operators
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Simulated annealing beats metropolis in combinatorial optimization
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
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
Rigorous runtime analysis of the (1+1) ES: 1/5-rule and ellipsoidal fitness landscapes
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Theoretical Computer Science
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Runtime analysis of evolutionary algorithms: basic introduction
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |
Randomized search heuristics like evolutionary algorithms are mostly applied to problems whose structure is not completely known but also to combinatorial optimization problems. Practitioners report surprising successes but almost no results with theoretically well-founded analyses exist. Such an analysis is started in this paper for a fundamental evolutionary algorithm and the well-known maximum matching problem. It is proven that the evolutionary algorithm is a polynomial-time randomized approximation scheme (PRAS) for this optimization problem, although the algorithm does not employ the idea of augmenting paths. Moreover, for very simple graphs it is proved that the expected optimization time of the algorithm is polynomially bounded and bipartite graphs are constructed where this time grows exponentially.