Partition into cliques for cubic graphs: Planar case, complexity and approximation

Given a graph G=(V,E) and a positive integer k, the partition into cliques (pic) decision problem consists of deciding whether there exists a partition of V into k disjoint subsets V"1,V"2,...,V"k such that the subgraph induced by each part V"i is a complete subgraph (clique) of G. In this paper, we establish both the NP-completeness of pic for planar cubic graphs and the Max SNP-hardness of pic for cubic graphs. We present a deterministic polynomial time 54-approximation algorithm for finding clique partitions in maximum degree three graphs.

[1]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[2]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[3]  Marek Karpinski,et al.  Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT , 2003, Electron. Colloquium Comput. Complex..

[4]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

[5]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[6]  R. L. Brooks.  On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[9]  Magnús M. Halldórsson,et al.  A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.

[10]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[11]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[12]  Magnns M Hallddrsson.  Approximating K-set Cover and Complementary Graph Coloring , .

[13]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[14]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[15]  Magnús M. Hallórsson.  A still better performance guarantee for approximate graph coloring , 1993 .

[16]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[17]  Harry B. Hunt,et al.  The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..

[18]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[19]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .