Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems
暂无分享,去创建一个
Pietro Simone Oliveto | Xin Yao | Jun He | X. Yao | Jun He | P. S. Oliveto
[1] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[2] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .
[3] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[4] Ingo Wegener,et al. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions , 2005, J. Discrete Algorithms.
[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[6] Ingo Wegener,et al. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..
[7] Thomas Jansen,et al. On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.
[8] Frank Harary,et al. Graph Theory , 2016 .
[9] XI FachbereichInformatik. Finite Markov Chain Results in Evolutionary Computation: a Tour D'horizon , 1998 .
[10] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[11] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[12] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[13] Isaac K. Evans,et al. Evolutionary Algorithms for Vertex Cover , 1998, Evolutionary Programming.
[14] Frank Neumann,et al. On improving approximate solutions by evolutionary algorithms , 2007 .
[15] Tobias Storch,et al. Finding large cliques in sparse semi-random graphs by simple randomized search heuristics , 2007, Theor. Comput. Sci..
[16] The Centre of Excellence for Research in Computational Intelligence and Applications , .
[17] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[18] John Clark,et al. A First Look at Graph Theory , 1991 .
[19] Pietro Simone Oliveto,et al. Evolutionary algorithms and the Vertex Cover problem , 2007, 2007 IEEE Congress on Evolutionary Computation.
[20] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[21] Ingo Wegener,et al. A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.
[22] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[23] Thomas H. Cormen,et al. Introduction to algorithms [2nd ed.] , 2001 .
[24] Xin Yao,et al. Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching , 2008, Journal of Computer Science and Technology.
[25] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[26] Xin Yao,et al. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..
[27] Pietro Simone Oliveto,et al. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.
[28] Ingo Wegener,et al. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .
[29] Xin Yao,et al. Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..
[30] Xin Yao,et al. A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem , 2005, IEEE Trans. Syst. Man Cybern. Part C.
[31] Carsten Witt,et al. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.
[32] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[33] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.
[34] Carsten Witt,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .
[35] Xin Yao,et al. Evolutionary Optimization , 2002 .