David Chalupa
ABSTRACT
We analyze the properties of a recently proposed order-based representation of the NP-hard (vertex) clique covering problem (CCP). In this representation, a permutation of vertices is mapped to a clique covering using greedy clique covering (GCC) and the identified cliques are put into the permutation as blocks. Block-based mutation operators can be then used to improve the clique covering in a stochastic algorithm, which is referred to as iterated greedy (IG). In this paper, we analytically investigate how the block-based mutation operators influence the quality of the solution. We formulate a sufficient condition for an improvement by a block-based operator to occur. We apply it in a proof of polynomial-time convergence of a block-based algorithm on paths. We also discuss the behavior of the algorithm on complements of bipartite graphs, where it can have a spectrum of possible behavior, ranging from polynomial-time convergence to getting stuck in a suboptimal solution. Worst-case result is proven for a graph class, where the algorithm gets stuck in a suboptimal solution with an overwhelming probability.
- A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics, volume 1 of Series on Theoretical Computer Science. World Scientific, 2011. Google Scholar
Digital Library
- M. Behrisch and A. Taraz. Efficiently covering complex networks with cliques of similar vertices. Theor Comput Sci, 355(1):37--47, 2006. Google ScholarDigital Library
- D. Chalupa. On the efficiency of an order-based representation in the clique covering problem. In T. Soule and J. Moore, editors, Proceedings of the 14th annual conference on Genetic and evolutionary computation, GECCO '12, pages 353--360, New York, NY, USA, 2012. ACM. Google ScholarDigital Library
- J. C. Culberson and F. Luo. Exploring the k-colorable landscape with iterated greedy. In D. S. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, pages 245--284. American Mathematical Society, 1995.Google Scholar
- T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt. Analyses of simple hybrid algorithms for the vertex cover problem. Evolutionary Comput, 17(1):3--19, 2009. Google ScholarDigital Library
- O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In H. Alt and M. Habib, editors, STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 415--426. Springer Berlin Heidelberg, 2003. Google ScholarDigital Library
- J. E. Hopcroft and R. M. Karp. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J Comput, 2:225--231, 1973.Google ScholarDigital Library
- R. M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Proceedings of a Symposium on the Complexity of Computer Computations, pages 85--103. Plenum Press, New York, NY, USA, 1972.Google ScholarCross Ref
- F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer Berlin Heidelberg, 2010. Google ScholarDigital Library
- P. S. Oliveto and C. Witt. On the analysis of the simple genetic algorithm. In T. Soule and J. Moore, editors, Proceedings of the 14th annual conference on Genetic and evolutionary computation, GECCO '12, pages 1341--1348, New York, NY, USA, 2012. ACM. Google ScholarDigital Library
- J. Pattillo, N. Youssef, and S. Butenko. Clique relaxation models in social network analysis. In M. T. Thai and P. M. Pardalos, editors, Handbook of Optimization in Complex Networks, pages 143--162. Springer, 2012.Google ScholarCross Ref
- S. E. Schaeffer. Graph clustering. Comput Sci Rev, 1(1):27--64, 2007. Google ScholarDigital Library
- D. Sudholt and C. Zarges. Analysis of an iterated local search algorithm for vertex coloring. In O. Cheong, K. Y. Chwa, and K. Park, editors, Algorithms and Computation, volume 6506 of Lecture Notes in Computer Science, pages 340--352. Springer Berlin Heidelberg, 2010.Google Scholar
- D. J. A. Welsh and M. B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Comput J, 10(1):85--86, 1967.Google ScholarCross Ref
- C. Witt. Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. Theor Comput Sci, 425:117--125, 2012. Google ScholarDigital Library
Index Terms
- An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms
Recommendations
Local Clique Covering of Claw-Free Graphs
A k-clique covering of a simple graph G is a collection of cliques of G covering all the edges of G such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-clique covering is called the local clique cover number of ...
On the efficiency of an order-based representation in the clique covering problem
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computationAlthough the (vertex) clique covering problem (CCP) is a classical NP-hard problem, it is still overlooked in the fields of heuristics and evolutionary algorithms. We present two main results concerning this problem. First, we propose a genotype-...
On clique coverings of complete multipartite graphs
AbstractA clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one of these cliques, and the weight of a clique covering is the sum of the sizes of the cliques in it. The sigma clique cover number ...
Comments