Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem

Evolutionary Computation (2009) 17 (1): 3–19.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Runtime analysis of some hybrid algorithms
  • Xinsheng Lai
  • Yuren Zhou
Neural Computing and Applications (2023) 35 (19): 14153.
Helper and Equivalent Objectives: Efficient Approach for Constrained Optimization
  • Tao Xu
  • Jun He
  • Changjing Shang
IEEE Transactions on Cybernetics (2022) 52 (1): 240.
Towards efficient local search for the minimum total dominating set problem
  • Shuli Hu
  • Huan Liu
  • Yupan Wang
  • Ruizhi Li
  • Minghao Yin
  • Nan Yang
Applied Intelligence (2021) 51 (12): 8753.
Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem
  • Feng Shi
  • Frank Neumann
  • Jianxin Wang
Theoretical Computer Science (2021) 893: 159.
Multi-objective evolutionary computation for topology coverage assessment problem
  • Xing Zhou
  • Huaimin Wang
  • Bo Ding
  • Wei Peng
  • Rui Wang
Knowledge-Based Systems (2019) 177: 1.
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem
  • Mojgan Pourhassan
  • Feng Shi
  • Frank Neumann
Evolutionary Computation (2019) 27 (4): 559.
Potential Game Theoretic Learning for the Minimal Weighted Vertex Cover in Distributed Networking Systems
  • Changhao Sun
  • Wei Sun
  • Xiaochu Wang
  • Qingrui Zhou
IEEE Transactions on Cybernetics (2019) 49 (5): 1968.
Approximation guarantees of evolutionary optimization on the minimum crossing spanning tree problem
  • Jianping Zhang
  • Hong Zhou
  • Huimin Gao
Cluster Computing (2019) 22 (2): 409.
On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring
  • D. Chalupa
Journal of Experimental & Theoretical Artificial Intelligence (2018) 30 (1): 53.
Success rates analysis of three hybrid algorithms on SAT instances
  • Xinsheng Lai
  • Yuren Zhou
Swarm and Evolutionary Computation (2017) 34: 119.
Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem
  • Yuren Zhou
  • Jun Zhang
  • Yong Wang
Algorithmica (2015) 73 (1): 21.
On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem
  • Xiaoyun Xia
  • Yuren Zhou
  • Xinsheng Lai
International Journal of Computer Mathematics (2015) 92 (10): 2023.
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
  • Stefan Kratsch
  • Frank Neumann
Algorithmica (2013) 65 (4): 754.
On the approximation ability of evolutionary optimization with application to minimum set cover
  • Yang Yu
  • Xin Yao
  • Zhi-Hua Zhou
Artificial Intelligence (2012) 180-181: 20.
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
  • Carsten Witt
Theoretical Computer Science (2012) 425: 117.
The use of tail inequalities on the probable computational time of randomized search heuristics
  • Dong Zhou
  • Dan Luo
  • Ruqian Lu
  • Zhangang Han
Theoretical Computer Science (2012) 436: 106.

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2023 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept