Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 5, 2009, Pages 1006-1029

  Oliveto, Pietro S ^a   He, Jun ^a   Yao, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Combinatorial optimization; Computational complexity; Evolutionary algorithms; Vertex cover; Worst case approximation

Indexed keywords

APPROXIMATE SOLUTION; APPROXIMATION RATIOS; COMBINATORIAL OPTIMIZATION PROBLEMS; EMPIRICAL RESULTS; LOCAL SEARCH ALGORITHM; LOWER BOUNDS; NP-HARD; OPTIMIZATION TASK; POLYNOMIAL-TIME; RESTART STRATEGY; STATE-OF-THE-ART ALGORITHMS; VERTEX COVER; VERTEX COVER PROBLEMS; VERTEX DEGREE; WORST CASE; WORST-CASE APPROXIMATION;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; CONTROL THEORY; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

EVOLUTIONARY ALGORITHMS;

EID: 70349866664     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2009.2014362     Document Type: Article

References (33)

1. P. S. Oliveto, J. He, and X. Yao, "Evolutionary algorithms and the vertex cover problem," in Proc. Congr. Evol. Comput. (CEC '07 , Singapore, Sep. 2007, pp. 1870-1877.
2. R. Sarker, M. Mohammadian, and X. Yao, Evolutionary Optimization. Norwell, MA: Kluwer, 2002.
3. G. Rudolph, "Finite Markov chain results in evolutionary computation: A tour d'horizon," Fundamenta Informaticae, vol. 35, no. 1-4, pp. 67-89, 1998.
4. S. Droste, T. Jansen, and I. Wegener, "On the optimization of unimodal functions with the (1+1) evolutionary algorithm," in Proc. 5th Int. Conf. Parallel Problem Solving from Nature, London, U.K.: Springer-Verlag, 1998, pp. 13-22.
5. T. Jansen and I. Wegener, "Evolutionary algorithms: How to cope with plateaus of constant fitness and when to reject strings of the same fitness," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 589-599, Dec. 2001.
6. I. Wegener, "Methods for the analysis of evolutionary algorithms on pseudo-boolean functions," in Proc. Evol. Optimization, Dordrecht, The Netherlands: Kluwer, 2001, pp. 349-369.
7. J. He and X. Yao, "Toward an analytic framework for analysing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, no. 1-2, pp. 59-97, 2003.
8. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1 + 1) evolutionary algorithm," Theor. Comput. Sci., vol. 276, no. 1-2, pp. 51-81, 2002.
9. I. Wegener and C. Witt, "On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions." J. Discrete Algorithms, vol. 3, no. 1, pp. 61-78, 2005.
10. O. Giel and I. Wegener, "Evolutionary algorithms and the maximum matching problem," in Proc. 20th Annu. Symp. Theoretical Aspects Comput. Sci. (STACS '03), London, U.K.: Springer-Verlag, pp. 415-426.
11. J. He and X. Yao, "Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching," J. Comput. Sci. Technol., vol. 19, no. 4, pp. 450-458, 2004.
12. F. Neumann and I. Wegener, "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem," Theoretical Comput. Sci., vol. 378, no. 1, pp. 32-40, 2007.
13. C. Witt, "Worst-case and average-case approximations by simple randomized search heuristics," in Proc. 22nd Annu. Symp. Theor. Aspects Comput. Sci. (STACS '05), LNCS vol. 3404, pp. 44-56.
14. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artificial Intell., vol. 127, no. 1, pp. 57-85, 2001.
15. J. He and X. Yao, "A study of drift analysis for estimating computation time of evolutionary algorithms," Natural Computing: Int. J., vol. 3, no. 1, pp. 21-35, 2004.
16. P. S. Oliveto, J. He, and X. Yao, "Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results," Int. J. Automation Computing, vol. 4, no. 3, pp. 281-293, 2007.
17. S. Khuri and T. Bäck, "An evolutionary heuristic for the minimum vertex cover problem," in Proc. KI-94 Workshop Genetic Algorithms Within Framework Evol. Comput., Saarbrücken, Germany, 1994, pp. 86-90.
18. G. H. Sasaki and B. Hajek, "The time complexity of maximum matching by simulated annealing," J. ACM, vol. 35, no. 2, pp. 387-403, 1988.
19. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995
20. T. Storch, "Finding large cliques in sparse semi-random graphs by simple randomised search heuristics," Theoretical Comput. Sci., vol. 386, no. 1-2, pp. 114-131, 2007.
21. E. Halperin, "Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs," in Proc. Symp. Discrete Algorithms, 2000, pp. 329-337.
22. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). New York: W. H. Freeman, 1979, ch. 4, sec. 1, p. 84.
23. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. New York: Dover, 1998, ch. 15, sec. 6, pp. 360-363.
24. J. He, X. Yao, and J. Li, "A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problems," IEEE Trans. Syst., Man, Cybern., Part C, vol. 35, no. 2, pp. 266-271, 2005.
25. T. H. Cormen, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms. 2nd ed. New York: McGraw-Hill, 2001, ch. 3, sec. 1, pp. 41-50.
26. I. K. Evans, "Evolutionary algorithms for vertex cover," in Proc. Evol. Programming VII, Berlin, Germany: Springer-Verlag, 1998, pp. 377-386.
27. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt, "Approximating covering problems by randomized search heuristics using multiobjective models," in Proc. Genetic Evol. Comput. Conf. (GECCO '07), London, U.K., Jul. 2007, pp. 797-804.
28. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt, "On improving approximate solutions by evolutionary algorithms," in Proc. Congr. Evol. Comput. (CEC '07), Singapore, Sep. 2007, pp. 2614-2621.
29. B. Hajek, "Hitting-time and occupation-time bounds implied by drift analysis with applications," Advances Appl. Probability, vol. 14, no. 3, pp. 502-525, 1982.
30. P. S. Oliveto and C. Witt, "Simplified drift analysis for proving lower bounds in evolutionary computation," in Proc. 10th Int. Conf. Parallel Problem Solving Nature, 2008, pp. 82-91.
31. N. Biggs, E. K. Lloyd, and R. J. Wilson, Graph Theory. New York: Oxford Univ. Press, 1976.
32. S. Droste, T. Jansen, and I. Wegener, "A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with boolean inputs." Evol. Comput., vol. 6, no. 2, pp. 185-196, 1998.
33. J. Clark and D. A. Holton, A First Look at Graph Theory. Singapore: World Scientific, 1991.