A hybrid heuristic for the minimum weight vertex cover problem

Asia-Pacific Journal of Operational Research

Volumn 23, Issue 2, 2006, Pages 273-285

  Singh, Alok ^a   Gupta, Ashok Kumar ^a  

^a UNIVERSITY OF ALLAHABAD   (India)

Author keywords

Combinatorial optimization; Greedy heuristic; Minimum weight vertex cover; Steady state genetic algorithm

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; GRAPH THEORY; HYBRID COMPUTERS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

HYBRID APPROACH; STEADY-STATE; VERTICES; WEIGHT VERTEX COVER;

HEURISTIC METHODS;

EID: 33746041815     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595906000905     Document Type: Article

References (22)

1. Balasubramanian, R, MR Fellows and V Raman (1998). An improved fixed-parameter algorithm for vertex cover. Information Processing Letters, 65, 163-168.
2. Bar-Yehuda, R and S Even (1985). A local-ratio theorem for approximating with the weighted vertex cover problem. Annals of Discrete Mathematics, 25, 27-45.
3. Beasley, JE and PC Chu (1996). A genetic algorithm for the set covering problem. European Journal of Operation Research, 94, 394-404.
4. Chen, J, IA Kanj and W Jia (1999). Vertex cover: further observations and further improvements. The 25th International Workshop on Graph-Theoretical Concepts in Computer Science.
5. Chvatal, V (1979). A greedy-heuristic for the set cover problem. Mathematics of Operations Research, 4, 233-235.
6. Clarkson, KL (1983). A modification of the greedy algorithm for vertex cover. Information Processing Letters, 16, 23-25.
7. Davis, L (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.
8. Dinur, I and S Safra (2001). The importance of being biased. Technical Report, Department of Computer Science, Tel Aviv University, Israel.
9. Dorigo, M and T Stutzle (2004). Ant Colony Optimization. MIT Press/Bradford Books.
10. Downey, RG and MR Fellows (1995). Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24, 873-921.
11. Evans, IK (1997). Reemphasizing recombination in evolutionary search: heuristics for vertex cover. Ph.D. Thesis. University of Iowa.
12. Evans, IK (1998). Evolutionary algorithms for vertex cover. In Proceedings of the 7th International Conference on Evolutionary Programming (EP98). Springer, 377-386.
13. Garey, MR and DS Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.
14. Goldberg, DE (1989). Genetic Algorithm in Search, Optimization, and Machine Learning. Reading, MA: Adisson-Wesley.
15. Hastad, J (2001). Some optimal inapproximability results. Journal of the ACM, 48, 798-859.
16. Khuri, S and T Back (1994). An evolutionary heuristic for the minimum vertex cover problem. In: J Kunje and H Stogan (eds.) KI-94 Workshops (Extended Abstracts), 83-84.
17. Mitchell, M (1996). An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press.
18. Monien, B and E Speckenmeyer (1985). Ramey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica, 22, 115-123.
19. Motwani, R (1992). Lecture notes on approximation algorithms. Technical Report No. STAN-CS-92-1435, Department of Computer Science, Stanford University.
20. Paschos, VT (1997). A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys, 29, 171-209.
21. Pitt, L (1985). A simple probabilistic approximation algorithm for vertex cover. Technical Report No. YaleU/DCS/TR-404, Department of Computer Science, Yale University.
22. Shyu, SJ, PY Yin and BMT Lin (2004). An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research, 131, 283-304.