Complete partitions of graphs

A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a complete partition of G. This measure was defined in 1969 by Gupta [19], and is known to be NP-hard to compute for several classes of graphs. We obtain essentially tight lower and upper bounds on the approximability of this problem. We show that there is a randomized polynomial-time algorithm that given a graph G with n vertices, produces a complete partition of size Ω(cp(G)/√lgn). This algorithm can be derandomized.We show that the upper bound is essentially tight: there is a constant C > 1, such that if there is a randomized polynomial-time algorithm that for all large n, when given a graph G with n vertices produces a complete partition into at least C·cp(G)/√lgn classes, then NP ⊆ RTime(nO(lg lg n)). The problem of finding a complete partition of a graph is thus the first natural problem whose approximation threshold has been determined to be of the form Θ((lgn)c) for some constant c strictly between 0 and 1.

[1]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[2]  A. Kostochka.  The minimum Hadwiger number for graphs with a given mean degree of vertices , 1982 .

[3]  Magnús M. Halldórsson,et al.  Approximating the Minimum Maximal Independence Number , 1993, Inf. Process. Lett..

[4]  Hans L. Bodlaender,et al.  Achromatic Number is NP-Complete for Cographs and Interval Graphs , 1989, Inf. Process. Lett..

[5]  Robert Krauthgamer,et al.  On approximating the achromatic number , 2001, SODA '01.

[6]  Bruce A. Reed,et al.  An extremal function for the achromatic number , 1991, Graph Structure Theory.

[7]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[8]  FeigeUriel,et al.  Approximating the Domatic Number , 2003 .

[9]  Jack Edmonds,et al.  Matching: A Well-Solved Class of Integer Linear Programs , 2001, Combinatorial Optimization.

[10]  Aravind Srinivasan,et al.  Approximating the Domatic Number , 2002, SIAM J. Comput..

[11]  C. McDiarmid.  Achromatic numbers of random graphs , 1982 .

[12]  Robert Krauthgamer,et al.  Tight lower bounds for the asymmetric k-center problem , 2003, Electron. Colloquium Comput. Complex..

[13]  Desh Ranjan,et al.  Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

[14]  Colin McDiarmid,et al.  The Complexity of Harmonious Colouring for Trees , 1995, Discret. Appl. Math..

[15]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[16]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Keith Edwards,et al.  The achromatic number of bounded degree trees , 1998, Discret. Math..

[18]  Béla Bollobás,et al.  Hadwiger's Conjecture is True for Almost Every Graph , 1980, Eur. J. Comb..

[19]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[21]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[22]  Guy Kortsarz.  On the Hardness of Approximating Spanners , 2001, Algorithmica.

[23]  Guy Kortsarz,et al.  Approximating the Achromatic Number Problem on Bipartite Graphs , 2003, ESA.

[24]  Keith J. Edwards.  Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi , 2000, Discret. Math..

[25]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[26]  YannakakisMihalis,et al.  On the hardness of approximating minimization problems , 1994 .

[27]  Venkatesh Raman,et al.  On the pseudoachromatic number of join of graphs , 2003, Int. J. Comput. Math..

[28]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[29]  Ram P. Gupta.  Bounds on the chromatic and achromatic numbers of complimentary graphs , 1968 .

[30]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[31]  Keith Edwards,et al.  Some results on the achromatic number , 1997, J. Graph Theory.

[32]  E. Sampathkumar,et al.  Partition graphs and coloring numbers of a graph , 1976, Discret. Math..

[33]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[34]  Robin Thomas,et al.  Hadwiger's conjecture forK6-free graphs , 1993, Comb..

[35]  V. N. Bhave.  On the pseudoachromatic number of a graph , 1979 .

[36]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[37]  Frank Harary,et al.  An interpolation theorem for graphical homomorphisms , 1967 .

[38]  Peter Brucker.  Some Problems in Combinatorial Optimization , 1995 .

[39]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[40]  Keith Edwards,et al.  The harmonious chromatic number and the achromatic number , 1997 .