Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Randomized algorithms
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Minimum spanning trees made easier via multi-objective optimization
Natural Computing: an international journal
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Adjacency list matchings: an ideal genotype for cycle covers
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
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
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
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions
IEEE Transactions on Evolutionary Computation
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Running Time Analysis of ACO Systems for Shortest Path Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
On the effect of populations in evolutionary multi-objective optimisation**
Evolutionary Computation
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
| Hi-index | 0.00 |
We present a natural fitness function f for the multiobjective shortest path problem, which is a fundamental multiobjective combinatorial optimization problem known to be NP-hard. Thereafter, we conduct a rigorous runtime analysis of a simple evolutionary algorithm (EA) optimizing f. Interestingly, this simple general algorithm is a fully polynomial-time randomized approximation scheme (FPRAS) for the problem under consideration, which exemplifies how EAs are able to find good approximate solutions for hard problems.