How randomized search heuristics find maximum cliques in planar graphs

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 567-574

  Storch, Tobias ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Algorithms; Performance; Theory

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL METHODS; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; GRAPH MODELS; PLANAR GRAPHS;

HEURISTIC METHODS;

EID: 33750282113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144099     Document Type: Conference Paper

References (13)

1. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. Handbook of Combinatorial Optimization (supp. Vol. A), chapter The Maximum Clique Problem, pages 1-74. Kluwer, Dordrecht, 1999.
2. A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings 21th STOC, pages 574-586, 1989.
3. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
4. S. Droste, T. Jansen, and I. Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 2005. to appear.
5. D. Eppstein. Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications, 3:1-27, 1999.
6. U. Feige and J. Kilian. Heuristics for semi-random graph problems. Journal of Computer and System Science, 63:639-671, 2001.
7. T. Jansen. On the analysis of dynamic restart strategies for evolutionary algorithms. In Proceedings PPSN VII, pages 33-43, 2002.
8. M. Jerrum. Large cliques elude the Metropolis process. Random Structrures and Algorithms, 3:347-360, 1992.
9. R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103, 1972.
10. C. McDiarmid, A. Steger, and D. J. A. Welsh. Random planar graphs. Journal of Combinatorial Theory, Series B, 93:187-205, 2005.
11. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
12. T. Storch. On the choice of the population size. In Proceedings GECCO 2004, pages 748-760, 2004.
13. R. E. Tarjan and A. E. Trojanowski. Finding a maximum independent set. SIAM Journal on Computing, 6:537-546, 1977.