A computational view of population genetics
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
Techniques for bounding the convergence rate of genetic algorithms
Random Structures & Algorithms
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Intelligent Packets For Dynamic Network Routing Using Distributed Genetic Algorithm
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Real royal road functions for constant population size
Theoretical Computer Science
Crossover is provably essential for the Ising model on trees
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
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
Adding more intelligence to the network routing problem: AntNet and Ga-agents
Applied Soft Computing
Real royal road functions-where crossover provably is essential
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Simulated annealing beats metropolis in combinatorial optimization
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Runtime analysis of convex evolutionary search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Crossover speeds up building-block assembly
Proceedings of the 14th annual conference on Genetic and evolutionary computation
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
Mutation rate matters even when optimizing monotonic functions
Evolutionary Computation
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 5.23 |
We show that a natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a non-artificial problem.