Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
ACM Transactions on Mathematical Software (TOMS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Local Search Characteristics of Incomplete SAT Procedures
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Solving the maximum clique problem by k-opt local search
Proceedings of the 2004 ACM symposium on Applied computing
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
Scaling and probabilistic smoothing: dynamic local search for unweighted MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
A leader-based parallel cross entropy algorithm for MCP
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Approximating the maximum vertex/edge weighted clique using local search
Journal of Heuristics
A Stochastic Local Search Approach to Vertex Cover
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
A memetic genetic algorithm for the vertex p-center problem
Evolutionary Computation
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
On Effectively Finding Maximal Quasi-cliques in Graphs
Learning and Intelligent Optimization
Matching of anatomical tree structures for registration of medical images
Image and Vision Computing
A population based hybrid meta-heuristic for the uncapacitated facility location problem
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Techniques and Tools for Local Search Landscape Visualization and Analysis
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Reactive and dynamic local search for max-clique: Engineering effective building blocks
Computers and Operations Research
A comparison of evolutionary algorithms for finding optimal error-correcting codes
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Iterated k-opt local search for the maximum clique problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Fast local search for the maximum independent set problem
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A Max-SAT inference-based pre-processing for Max-clique
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part II
Cooperating local search for the maximum clique problem
Journal of Heuristics
Memetic algorithm with strategic controller for the maximum clique problem
Proceedings of the 2011 ACM Symposium on Applied Computing
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
A complete resolution of the Keller maximum clique problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A search problem in complex diagnostic Bayesian networks
Knowledge-Based Systems
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
Breakout Local Search for maximum clique problems
Computers and Operations Research
Subgraph extraction and metaheuristics for the maximum clique problem
Journal of Heuristics
Online search of overlapping communities
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
An adaptive multistart tabu search approach to solve the maximum clique problem
Journal of Combinatorial Optimization
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
Improvements to MCS algorithm for the maximum clique problem
Journal of Combinatorial Optimization
Speeding up branch and bound algorithms for solving the maximum clique problem
Journal of Global Optimization
Hi-index | 0.00 |
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which suitable vertices are added to the current clique, and plateau search, during which vertices of the current clique are swapped with vertices not contained in the current clique. The selection of vertices is solely based on vertex penalties that are dynamically adjusted during the search, and a perturbation mechanism is used to overcome search stagnation. The behaviour of DLS-MC is controlled by a single parameter, penalty delay, which controls the frequency at which vertex penalties are reduced. We show empirically that DLSMC achieves substantial performance improvements over state-of-the-art algorithms for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.