Approximating the maximum vertex/edge weighted clique using local search

Journal of Heuristics

Volumn 14, Issue 2, 2008, Pages 117-134

  Pullan, Wayne ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Local search; Maximum weighted clique

Indexed keywords

APPROXIMATION THEORY; ITERATIVE METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

DIMACS; PHASED LOCAL SEARCH (PLS) ALGORITHM; SUB-ALGORITHMS; VERTEX DEGREE;

ALGORITHMS;

EID: 41149093989     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9026-2     Document Type: Article

References (16)

1. Babel, L.: A fast algorithm for the maximum weight clique problem. Computing 52, 31-38 (1994)
2. Ballard, D., Brown, C.: Computer Vision. Prentice-Hall, Englewood Cliffs (1982)
3. Balus, E., Yu, C.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054-1068 (1986)
4. 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)
5. 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)
6. Bomze, I., Pelillo, M., Stix, V.: Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural. Netw. 11 (2000)
7. Boppana, R., Halldórsson, M.: Approximating maximum independent sets by excluding subgraphs. Bit 32, 180-196 (1992)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of script N sign script P sign -Completeness. Freeman, San Francisco (1979)
9. 1-ε. Acta Math. 182, 105-142 (1999)
10. 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)
11. Johnson, D., Trick, M. (eds.): Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series, vol. 26. American Mathematical Society, Providence (1996)
12. Macambira, E.: An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Ann. Oper. Res. 117, 175-190 (2003)
13. Macambira, E., de Souza, C.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 117, 175-190 (2000)
14. 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)
15. Pullan, W.: Phased local search for the maximum clique problem. J. Comb. Optim. 12, 303-323 (2006)
16. Pullan, W., Hoos, H.: Dynamic local search for the maximum clique problem. J. Art. Intell. Res. 25, 159-185 (2006)