1 |
R. Motwani, “Lecture notes on approximation algorithms: Volume I,” Tech. Rep. CS-TR-92-1435, Stanford University, Department of Computer Science, Stanford University, CA, 1992
|
2 |
Holland, J., “Adaptation in natural and artificial systems,” University of Michigan Press, Ann Arbor, 1975
|
3 |
S. Khuri and T. Back, “An evolutionary heuristic for the minimum vertex cover problem,” Proc. of the KI-94 Workshop, pp.86-90, 1994
|
4 |
I. K. Evans, “Evolutionary algorithms for vertex cover,” Lecture Notes in Computer Science, Vol. 1477, pp.377-386, 1998
DOI
ScienceOn
|
5 |
Gilmour, S. and Dras, M., “Kernelization as heuristic structure for the vertex cover problem,” proceedings of the Third Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2006), Brussels, Belgium, 2006
|
6 |
Jun He, Xin Yao and Jin Li, “A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem,” IEEE Transactions on Systems, Man and Cybernetics, Part C 35(2), pp.266-271, 2005
DOI
ScienceOn
|
7 |
Xu, K., “BHOSLIB: Benchmarks with hidden optimum solutions for graph problems (maximum clique, maximum independent set, minimum vertex cover and vertex coloring) – hiding exact solutions in random graphs,” Web site, http://www.nlsde.buaa.edu.en/~kexu/benchmarks/graphbenchmarks.htm
|