Two New Local Search Strategies for Minimum Vertex Cover
暂无分享,去创建一个
[1] Wayne J. Pullan,et al. Phased local search for the maximum clique problem , 2006, J. Comb. Optim..
[2] Charu C. Aggarwal,et al. Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..
[3] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[4] Valmir Carneiro Barbosa,et al. A Novel Evolutionary Formulation of the Maximum Independent Set Problem , 2003, J. Comb. Optim..
[5] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[6] Wayne J. Pullan,et al. Simple ingredients leading to very efficient heuristics for the maximum clique problem , 2008, J. Heuristics.
[7] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[8] Dale Schuurmans,et al. The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming , 2001, IJCAI.
[9] Chu Min Li,et al. An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem , 2010, AAAI 2010.
[10] Panos M. Pardalos,et al. A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere , 2002, J. Comb. Optim..
[11] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[12] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[13] Abdul Sattar,et al. Neighbourhood Clause Weight Redistribution in Local Search for SAT , 2005, CP.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Ke Xu,et al. Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..
[16] Kaile Su,et al. Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.
[17] Kaile Su,et al. EWLS: A New Local Search for Minimum Vertex Cover , 2010, AAAI.
[18] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[19] Emile H. L. Aarts,et al. Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series) , 2007 .
[20] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[21] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[22] Abdul Sattar,et al. Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..
[23] M. Trick,et al. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .
[24] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[25] Emile H. L. Aarts,et al. Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.
[26] Chu Min Li,et al. Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.
[27] Bertrand M. T. Lin,et al. An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..
[29] Wayne J. Pullan,et al. Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..
[30] Wei Li,et al. Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..
[31] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[32] Mauro Brunato,et al. Cooperating local search for the maximum clique problem , 2011, J. Heuristics.
[33] Malte Helmert,et al. A Stochastic Local Search Approach to Vertex Cover , 2007, KI.
[34] Diogo Vieira Andrade,et al. Fast local search for the maximum independent set problem , 2008, Journal of Heuristics.
[35] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[36] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.