Skip to main content
Log in

Approximating the maximum vertex/edge weighted clique using local search

Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper extends the recently introduced Phased Local Search (PLS) algorithm to more difficult maximum clique problems and also adapts the algorithm to handle maximum vertex/edge weighted clique instances. PLS is a stochastic reactive dynamic local search algorithm that interleaves sub-algorithms which alternate between sequences of iterative improvement, during which suitable vertices are added to the current sub-graph, and plateau search, where vertices of the current sub-graph are swapped with vertices not contained in the current sub-graph. These sub-algorithms differ in firstly their vertex selection techniques in that selection can be solely based on randomly selecting a vertex, randomly selecting within highest vertex degree, or random selecting within vertex penalties that are dynamically adjusted during the search. Secondly, the perturbation mechanism used to overcome search stagnation differs between the sub-algorithms. PLS has no problem instance dependent parameters and achieves state-of-the-art performance for maximum clique and maximum vertex/edge weighted clique problems over a large range of the commonly used DIMACS benchmark instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Babel, L.: A fast algorithm for the maximum weight clique problem. Computing 52, 31–38 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  • Ballard, D., Brown, C.: Computer Vision. Prentice-Hall, Englewood Cliffs (1982)

    Google Scholar 

  • Balus, E., Yu, C.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054–1068 (1986)

    Article  MathSciNet  Google Scholar 

  • Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.Z. (ed.) Handbook of Combinatorial Optimization, vol. A, pp. 1–74 (1999)

  • Bomze, I., Budinich, M., Pelillo, M., Rossi, C.: Annealed replication: a new heuristic for the maximum clique problem. Discret. Appl. Math. 121, 27–49 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Bomze, I., Pelillo, M., Stix, V.: Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural. Netw. 11 (2000)

  • Boppana, R., Halldórsson, M.: Approximating maximum independent sets by excluding subgraphs. Bit 32, 180–196 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of \(\mathcal{NP}\) -Completeness. Freeman, San Francisco (1979)

    Google Scholar 

  • Håstad, J.: Clique is hard to approximate within n 1−ε. Acta Math. 182, 105–142 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Ji, Y., Xu, X., Stormo, G.D.: A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. Bioinformatics 20(10), 1591–1602 (2004)

    Article  Google Scholar 

  • Johnson, D., Trick, M. (eds.): Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series, vol. 26. American Mathematical Society, Providence (1996)

  • Macambira, E.: An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Ann. Oper. Res. 117, 175–190 (2003)

    Article  MathSciNet  Google Scholar 

  • Macambira, E., de Souza, C.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 117, 175–190 (2000)

    Google Scholar 

  • Pevzner, P.A., Sze, S.-H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pp. 269–278. AIAA, New York (2000)

    Google Scholar 

  • Pullan, W.: Phased local search for the maximum clique problem. J. Comb. Optim. 12, 303–323 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Pullan, W., Hoos, H.: Dynamic local search for the maximum clique problem. J. Art. Intell. Res. 25, 159–185 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wayne Pullan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pullan, W. Approximating the maximum vertex/edge weighted clique using local search. J Heuristics 14, 117–134 (2008). https://doi.org/10.1007/s10732-007-9026-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9026-2

Keywords

Navigation