EWLS: A new local search for Minimum Vertex Cover

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 45-50

  Cai, Shaowei ^a,b   Su, Kaile ^a,c   Chen, Qingliang ^d  

^a Peking University   (China)

^b PEKING UNIVERSITY   (China)

^c GRIFFITH UNIVERSITY   (Australia)

^d JINAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS;

EDGE WEIGHTS; EDGE-WEIGHTING; HARD INSTANCES; ITERATED LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MINIMUM VERTEX COVER; MINIMUM VERTEX COVER PROBLEMS; SEARCH STRATEGIES;

LOCAL SEARCH (OPTIMIZATION);

EID: 77958540557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Aggarwal, C; Orlin, J.; and Tai, R. 1997. Optimized crossover for the independent set problem. Operations Research 45:226-234.
2. Andrade, D. V.; Resende, M G. C; and Werneck, R. F. F. 2008. Fast local search for the maximum independent set problem. In Workshop on Experimental Algorithms, 220-234.
3. Barbosa, V. C, and Campos, L. C. D. 2004. A novel evolutionary formulation of the maximum independent set problem. J. Comb. Optim. 8(4):419-437.
4. Battiti, R., and Protasi, M. 2001. Reactive local search for the maximum clique problem. Algorithmica 29(4):610-637.
5. Busygin, S.; Butenko, S.; and Pardalos, P. M. 2002. A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. J. Comb. Optim. 6(3):287-297.
6. Busygin, S. 2002. A new trust region technique for the maximum clique problem. Internal report,. http://www.busygin.dp.ua.
7. Dinur, I., and Safra, S. 2005. On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(2):439-486.
8. Evans, I. 1998. An evolutionary heuristic for the minimum vertex cover problem. In Proc. EP-98, 377-386.
9. Fellows, M. R.; Rosamond, F. A.; Fomin, F. V.; Lokshtanov, D.; Saurabh, S.; and Villanger, Y. 2009. Local search: Is brute-force avoidable? In Proc. of IJCAI-09, 486-491.
10. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco, CA, USA: Freeman.
11. Gilmour, S., and Dras, M. 2006. Kernelization as heuristic structure for the vertex cover problem. In ANTS Workshop, 452-459.
12. Gomes, C. P.; Kautz, H.; Sabharwal, A.; and Selman, B. 2008. Satisfiability solvers. In Handbook of Knowledge Representation. Elsevier.
13. Grosso, A.; Locatelli, M.; and Croce, F. D. 2004. Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem. J. Heuristics 10(2): 135-152.
14. Grosso, A.; Locatelli, M.; and Pullan, W. J. 2008. Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6):587-612.
15. Halperin, E. 2002. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM Journal on Computing 31(5):1508-1623.
16. 1-ε. Acta Math 182:105-142.
17. Hastad, J. 2001. Some optimal inapproximability results. J. ACM 48(4):798-859.
18. Hutter, F.; Tompkins, D. A. D.; and Hoos, H. H. 2002. Scaling and probabilistic smoothing: Efficient dynamic local search for sat. In Proc. of CP-02, 233-248.
19. Karakostas, G. 2005. A better approximation ratio for the vertex cover problem. In Proc. of ICALP-05, 1043-1050
20. Katayama, K.;Hamamoto, A.; and Narihisa, H. 2004. Solving the maximum clique problem by k-opt local search. In Proc. SAC-2004, 1021-1025.
21. Katayama, K.; Sadamatsu, M.; and Narihisa, H. 2007. Iterated k-opt local search for the maximum clique problem. In EvoCOP, 84-95.
22. Morris, P. 1993. The breakout method for escaping from local minima. In Proc. of AAAI-93, 40-45.
23. Pullan, W., and Hoos, H. H. 2006. Dynamic local search for the maximum clique problem. J. Artif. Intell. Res. 25:159-185. (Pubitemid 43800045)
24. Pullan, W. 2006. Phased local search for the maximum clique problem. J. Comb. Optim. 12(3):303-323. (Pubitemid 44343195)
25. Pullan, W. 2009. Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers. Discrete Optimization 6:214-219.
26. Richter, S.; Helmert, M.; and Gretton, C. 2007. A stochastic local search approach to vertex cover. In Proc. of KI-07, 412-426.
27. Shyu, S. J.; Yin, P.; and Lin, B. M. T. 2004. An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals OR 131(1-4): 283-304.
28. Solnon, C, and Fenet, S. 2006. A study of aco capabilities for solving the maximum clique problem. J. Heuristics 12(3): 155-180.
29. Thornton, J. 2005. Clause weighting local search for sat. J. Autom. Reasoning 35(1-3):97-142.
30. Xu, K.; Boussemart, F; Hemery, F; and Lecoutre, C. 2007. Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artif. Intell. 171(8-9):514-534.