A stochastic local search approach to vertex cover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4667 LNAI, Issue , 2007, Pages 412-426

  Richter, Silvia ^a,c   Helmert, Malte ^b   Gretton, Charles ^a  

^a CSIRO   (Australia)

^b UNIVERSITY OF FREIBURG   (Germany)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; PROBLEM SOLVING; SEARCH ENGINES;

SEARCH ALGORITHMS; SEARCH TECHNIQUES; STOCHASTIC LOCAL SEARCH;

STOCHASTIC MODELS;

EID: 38149040279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74565-5_31     Document Type: Conference Paper

References (23)

1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)
2. Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Computers and Operations Research 33(12), 3520-3534 (2006)
3. Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica 45, 269-284 (2006)
4. Evans, I.K.: Evolutionary algorithms for vertex cover. In: Porto, V.W., Waagen, D. (eds.) Evolutionary Programming VII. LNCS, vol. 1447, pp. 377-386. Springer, Heidelberg (1998)
5. Gilmour, S., Dras, M.: Kernelization as heuristic structure for the vertex cover problem. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory. LNCS, vol. 4076, Springer, Heidelberg (2006)
6. Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. DI-MACS Series, vol. 49, pp. 49-99 (1999)
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.cn/~kexu/benchmarks/graph-benchmarks.htm
8. Niedermeier, R., Rossmanith, P.: Upper bounds for vertex cover further improved. In: Proceedings of the 16th Symposium on Theoretical Aspects in Computer Science (STACS'99), pp. 561-570 (1999)
9. Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: Solving large FPT problems on coarse grained parallel machines. Journal of Computer and System Sciences 67, 691-706 (2003)
10. Shyu, S.J., Yin, P.Y., Lin, B.M.T.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research 131(1-4), 283-304 (2004)
11. Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series, vol. 26. American Mathematical Society (1996)
12. Barbosa, V.C., Campos, L.C.D.: A novel evolutionary formulation of the maximum independent set problem. Journal of Combinatorial Optimization 8, 419-437 (2004)
13. Busygin, S., Butenko, S., Pardalos, P.M.: A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. Journal of Combinatorial Optimization 6, 287-297 (2002)
14. Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research 25, 159-185 (2006)
15. Pullan, W.: Phased local search for the maximum clique problem. Journal of Combinatorial Optimization 12, 303-323 (2006)
16. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)
17. Kullmann, O.: The SAT 2005 solver competition on random instances. Journal on Satisfiability, Boolean Modeling and Computation 2, 61-102 (2005)
18. Selman, B., Kautz, H.A.: Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pp. 290-295 (1993)
19. Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pp. 191-196 (2004)
20. Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A simple model to generate hard satisfiable instances. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 337-342 (2005)
21. Le Berre, D., Simon, L.: The SAT'04 competition. Web site, http://www.lri.fr/~simon/contest04/results/
22. Liu, L., Truszczynski, M.: Local-search techniques for propositional logic extended with cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 495-509. Springer, Heidelberg (2003)
23. Brockington, M., Culberson, J.C.: Camouflaging independent sets in quasi-random graphs, pp. 75-88 [11]