The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
Introduction to algorithms
On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Randomized algorithms
The metropolis algorithm for graph bisection
Discrete Applied Mathematics
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
Fitness Landscapes Based on Sorting and Shortest Paths Problems
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
Speeding up evolutionary algorithms through asymmetric mutation operators
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
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Ant Colony Optimization and the Minimum Spanning Tree Problem
Learning and Intelligent Optimization
On the size of weights in randomized search heuristics
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
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
The impact of parametrization in memetic evolutionary algorithms
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
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
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science
Ant Colony Optimization and the minimum spanning tree problem
Theoretical Computer Science
Edge-based representation beats vertex-based representation in shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Black-box search by unbiased variation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Proceedings of the 12th annual conference 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
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
The role of selective pressure when solving symmetric functions in polynomial time
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Using markov-chain mixing time estimates for the analysis of ant colony optimization
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Analysis of (1+1) evolutionary algorithm and randomized local search with memory
Evolutionary Computation
Black-box complexities of combinatorial problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Sharp bounds by probability-generating functions and variable drift
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Simulated annealing beats metropolis in combinatorial optimization
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
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
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
Black-box complexities of combinatorial problems
Theoretical Computer Science
How the (1+λ) evolutionary algorithm optimizes linear functions
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
Black-box complexity: from complexity theory to playing mastermind
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
Runtime analysis of the (1+1) EA on computing unique input output sequences
Information Sciences: an International Journal
| Hi-index | 5.24 |
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. The analysis of these randomized search heuristics has been started for some well-known problems, and this approach is followed here for the minimum spanning tree problem. After motivating this line of research, it is shown that randomized search heuristics find minimum spanning trees in expected polynomial time without employing the global technique of greedy algorithms.