Local search with edge weighting and configuration checking heuristics for minimum vertex cover

Artificial Intelligence

Volumn 175, Issue 9-10, 2011, Pages 1672-1696

  Cai, Shaowei ^a   Su, Kaile ^b,c   Sattar, Abdul ^b,d  

^a Peking University   (China)

^b GRIFFITH UNIVERSITY   (Australia)

^c INSTITUTE OF SOFTWARE   (China)

^d CSIRO   (Australia)

Author keywords

Configuration checking; Edge weighting; Local search; Minimum vertex cover

Indexed keywords

CANDIDATE SOLUTION; COMBINATORIAL OPTIMIZATION PROBLEMS; CONFIGURATION CHECKING; EDGE WEIGHTING; EDGE WEIGHTS; EFFICIENT ALGORITHM; EXACT ALGORITHMS; EXPERIMENTAL STUDIES; HARD INSTANCES; HARD PROBLEMS; INDUCED SUBGRAPHS; ITERATED LOCAL SEARCH; LOCAL OPTIMA; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MINIMUM VERTEX COVER; RUNTIMES; VERTEX COVER; WEIGHTING SCHEME;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS;

PROBLEM SOLVING;

EID: 79955122206     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2011.03.003     Document Type: Article

References (61)

1. C. Aggarwal, J. Orlin, and R. Tai Optimized crossover for the independent set problem Oper. Res. 45 1997 226 234 (Pubitemid 127684701)
2. D.V. Andrade, M.G.C. Resende, R.F.F. Werneck, Fast local search for the maximum independent set problem, in: Proc. of WEA-08, 2008, pp. 220-234.
3. V.C. Barbosa, and L.C.D. Campos A novel evolutionary formulation of the maximum independent set problem J. Comb. Optim. 8 4 2004 419 437 (Pubitemid 40356726)
4. R. Battiti, and M. Protasi Reactive local search for the maximum clique problem Algorithmica 29 4 2001 610 637 (Pubitemid 33710626)
5. D.L. Berre, L. Simon, Fifty-five solvers in Vancouver: the SAT 2004 competition, in: Proc. of SAT-04, 2004, pp. 321-344. (Pubitemid 41422892)
6. S. Busygin A new trust region technique for the maximum clique problem, internal report 2002 http://www.busygin.dp.ua
7. S. Busygin, S. Butenko, and P.M. Pardalos A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere J. Comb. Optim. 6 3 2002 287 297 (Pubitemid 34474870)
8. S. Cai, K. Su, Q. Chen, EWLS: A new local search for minimum vertex cover, in: Proc. of AAAI-10, 2010, pp. 45-50.
9. R. Carraghan, and P. Pardalos An exact algorithm for the maximum clique problem Oper. Res. Lett. 9 6 1990 375 382
10. R. Diestel Graph Theory third edition 2005 Springer-Verlag New York
11. I. Dinur, and S. Safra On the hardness of approximating minimum vertex cover Ann. of Math. 162 2 2005 439 486
12. I. Evans, An evolutionary heuristic for the minimum vertex cover problem, in: Proc. of EP-98, 1998, pp. 377-386. (Pubitemid 128118949)
13. T. Fahle, Simple and fast: Improving a branch-and-bound algorithm for maximum clique, in: Proc. of ESA-02, 2002, pp. 485-498.
14. U. Feige Approximating maximum clique by removing subgraphs SIAM J. Discrete Math. 18 2 2004 219 225 (Pubitemid 40672764)
15. M.R. Fellows, F.A. Rosamond, F.V. Fomin, D. Lokshtanov, S. Saurabh, Y. Villanger, Local search: Is brute-force avoidable? in: Proc. of IJCAI-09, 2009, pp. 486-491.
16. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman San Francisco, CA, USA
17. I.P. Gent, T. Walsh, Towards an understanding of hill-climbing procedures for SAT, in: Proc. of AAAI-93, 1993, pp. 28-33.
18. S. Gilmour, M. Dras, Kernelization as heuristic structure for the vertex cover problem, in: ANTS Workshop, 2006, pp. 452-459. (Pubitemid 44811976)
19. F. Glover Tabu search - Part I ORSA J. Comput. 1 3 1989 190 206
20. F. Glover Tabu search - Part II ORSA J. Comput. 2 1 1990 4 32
21. C.P. Gomes, H. Kautz, A. Sabharwal, and B. Selman Satisfiability solvers Handbook of Knowledge Representation 2008 Elsevier 89 134
22. A. Grosso, M. Locatelli, and F.D. Croce Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem J. Heuristics 10 2 2004 135 152
23. A. Grosso, M. Locatelli, and W.J. Pullan Simple ingredients leading to very efficient heuristics for the maximum clique problem J. Heuristics 14 6 2008 587 612
24. E. Halperin Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs SIAM J. Comput. 31 5 2002 1508 1623
25. - μ Acta Math. 182 1999 105 142
26. J. Håstad Some optimal inapproximability results J. ACM 48 4 2001 798 859
27. H.H. Hoos, and T. Stützle Towards a characterisation of the behaviour of stochastic local search algorithms for SAT Artificial Intelligence 112 1-2 1999 213 232 (Pubitemid 32079891)
28. H.H. Hoos, and T. Stützle Local search algorithms for SAT: An empirical evaluation J. Automat. Reason. 24 4 2000 421 481
29. H.H. Hoos, and T. Stützle Stochastic Local Search: Foundations & Applications 2004 Elsevier/Morgan Kaufmann
30. F. Hutter, D.A.D. Tompkins, H.H. Hoos, Scaling and probabilistic smoothing: Efficient dynamic local search for SAT, in: Proc. of CP-02, 2002, pp. 233-248.
31. A. Ishtaiwi, J. Thornton, Anbulagan, A. Sattar, D.N. Pham, Adaptive clause weight redistribution, in: Proc. of CP-06, 2006, pp. 229-243. (Pubitemid 44618742)
32. Y. Ji, X. Xu, and G.D. Stormo A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences Bioinformatics 20 10 2004 1603 1611
33. G. Karakostas, A better approximation ratio for the vertex cover problem, in: Proc. of ICALP-05, 2005, pp. 1043-1050. (Pubitemid 41436167)
34. K. Katayama, A. Hamamoto, H. Narihisa, Solving the maximum clique problem by k-opt local search, in: Proc. of SAC-04, 2004, pp. 1021-1025.
35. K. Katayama, M. Sadamatsu, H. Narihisa, Iterated k-opt local search for the maximum clique problem, in: Proc. of EvoCOP-07, 2007, pp. 84-95.
36. H.A. Kautz, A. Sabharwal, and B. Selman Incomplete algorithms Handbook of Satisfiability 2009 IOS Press 185 203
37. C. Li, W. Huang, Diversification and determinism in local search for satisfiability, in: Proc. of SAT-05, 2005, pp. 158-172. (Pubitemid 41425504)
38. C. Li, and F. Manyà Hard MaxSAT soft constraints Handbook of Satisfiability 2009 IOS Press 613 631
39. C. Li, Z. Quan, An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem, in: Proc. of AAAI-10, 2010, pp. 128-133.
40. C. Li, Z. Quan, Combining graph structure exploitation and propositional reasoning for the maximum clique problem, in: Proc. of ICTAI-10, 2010, pp. 344-351.
41. B. Mazure, L. Sais, É. Grégoire, Tabu search for sat, in: Proc. of AAAI-97, 1997, pp. 281-285.
42. D. McAllester, B. Selman, H. Kautz, Evidence for invariants in local search, in: Proc. of AAAI-97, 1997, pp. 321-326.
43. P. Morris, The breakout method for escaping from local minima, in: Proc. of AAAI-93, 1993, pp. 40-45.
44. P.R.J. Östergård A fast algorithm for the maximum clique problem Discrete Appl. Math. 120 1-3 2002 197 207
45. W. Pullan, and H.H. Hoos Dynamic local search for the maximum clique problem J. Artif. Intell. Res. (JAIR) 25 2006 159 185 (Pubitemid 43800045)
46. W. Pullan Phased local search for the maximum clique problem J. Comb. Optim. 12 3 2006 303 323 (Pubitemid 44343195)
47. W. Pullan Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers Discrete Optim. 6 2009 214 219
48. J.C. Régin, Using constraint programming to solve the maximum clique problem, in: Proc. of CP-03, 2003, pp. 634-648.
49. S. Richter, M. Helmert, C. Gretton, A stochastic local search approach to vertex cover, in: Proc. of KI-07, 2007, pp. 412-426.
50. S.J. Shyu, P. Yin, and B.M.T. Lin An ant colony optimization algorithm for the minimum weight vertex cover problem Ann. Oper. Res. 131 1-4 2004 283 304 (Pubitemid 39187384)
51. K. Smyth, H.H. Hoos, T. Stützle, Iterated robust tabu search for max-SAT, in: Canadian Conference on AI, 2003, pp. 129-144. (Pubitemid 36796053)
52. C. Solnon, and S. Fenet A study of ACO capabilities for solving the maximum clique problem J. Heuristics 12 3 2006 155 180
53. J. Thornton, D.N. Pham, S. Bain, V.F. Jr., Additive versus multiplicative clause weighting for SAT, in: Proc. of AAAI-04, 2004, pp. 191-196.
54. J. Thornton Clause weighting local search for SAT J. Automat. Reason. 35 1-3 2005 97 142 (Pubitemid 44619282)
55. E. Tomita, and T. Kameda An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments J. Global Optim. 44 2 2009 311
56. J.P. Watson, L.D. Whitley, and A.E. Howe Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search J. Artif. Intell. Res. (JAIR) 24 2005 221 261 (Pubitemid 43130937)
57. K. Xu, and W. Li Exact phase transitions in random constraint satisfaction problems J. Artif. Intell. Res. (JAIR) 12 2000 93 103
58. K. Xu, F. Boussemart, F. Hemery, C. Lecoutre, A simple model to generate hard satisfiable instances, in: Proc. of IJCAI-05, 2005, pp. 337-342.
59. K. Xu, and W. Li Many hard examples in exact phase transitions Theoret. Comput. Sci. 355 2006 291 302
60. K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre Random constraint satisfaction: Easy generation of hard (satisfiable) instances Artificial Intelligence 171 8-9 2007 514 534 (Pubitemid 46828981)
61. D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, in: Proc. of STOC-06, 2006, pp. 681-690. (Pubitemid 44306602)