In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.
|Titolo:||Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem|
|Data di pubblicazione:||2004|
|Digital Object Identifier (DOI):||10.1023/B:HEUR.0000026264.51747.7f|
|Appare nelle tipologie:||1.1 Articolo in rivista|