The rate of convergence to optimality of the LPT rule
Discrete Applied Mathematics
Randomized algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the impact of objective function transformations on evolutionary and black-box algorithms
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
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
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
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
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
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
Analyses of simple hybrid algorithms for the vertex cover problem*
Evolutionary Computation
Single- and multi-objective evolutionary algorithms for graph bisectioning
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
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
A pheromone-rate-based analysis on the convergence time of ACO algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Runtime analysis of an ant colony optimization algorithm for TSP instances
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
On the running time analysis of the (1+1) evolutionary algorithm for the subset sum problem
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Computational complexity and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
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
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
Too fast unbiased black-box algorithms
Proceedings of the 13th annual conference 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
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
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
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
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
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
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
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.02 |
In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact deterministic algorithms, little is known about the average-case behavior of randomized search heuristics (RSHs). In this paper, two simple RSHs are studied on a simple scheduling problem. While it turns out that in the worst case, both RSHs need exponential time to create solutions being significantly better than 4/3-approximate, an average-case analysis for two input distributions reveals that one RSH is convergent to optimality in polynomial time. Moreover, it is shown that for both RSHs, parallel runs yield a PRAS.