On approximate graph colouring and MAX-k-CUT algorithms based on the θ-function
نویسندگان
چکیده
The problem of colouring a k-colourable graph is well-known to be NP-complete, for k ≥ 3. The MAX-k-CUT approach to approximate k-colouring is to assign k colours to all of the vertices in polynomial time such that the fraction of ‘defect edges’ (with endpoints of the same colour) is provably small. The best known approximation was obtained by Frieze and Jerrum [9], using a semidefinite programming (SDP) relaxation which is related to the Lovász θ-function. In a related work, Karger et al. [18] devised approximation algorithms for colouring k-colourable graphs exactly in polynomial time with as few colours as possible. They also used an SDP relaxation related to the θ-function. In this paper we further explore semidefinite programming relaxations where graph colouring is viewed as a satisfiability problem, as considered in De Klerk et al. [6]. We first show that the approximation to the chromatic number suggested in [6] is bounded from above by the Lovász θ-function. The underlying semidefinite programming relaxation in [6] involves a lifting of the approximation space, which in turn suggests a provably good MAX-k-CUT algorithm. We show that of our algorithm is closely related to that of Frieze and Jerrum; thus we can sharpen their approximation guarantees for MAX-k-CUT for small fixed values of k. For example, if k = 3 we can improve their bound from 0.832718 to 0.836008, and for k = 4 from 0.850301 to 0.857487. We also give a new asymptotic analysis of the Frieze-Jerrum rounding scheme, that provides a unifying proof of the main results of both Frieze and Jerrum [9] and Karger et al. [18] for k ≫ 0.
منابع مشابه
Partitioning Based Algorithms for Some Colouring Problems
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max k-COL, which is the unweighted case of the Max k-Cut problem. The algorithms are based on the idea of partitioning the domain of the problems into disjoint subsets, and then considering all possible instances were the...
متن کاملDerandomizing Approximation Algorithms Based on Semidefinite Programming
Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP-hard problems, namely Max-Cut, Max k-Cut, Max-Sat, Max-Dicut, Max-bisection, k-vertex coloring, maximum independent set, etc. All these breakthroughs involve polynomial time randomized algorithms based upon semidefinite programming, a technique pioneered by Goemans and Williamson. In this ...
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملBiclique-colouring verification complexity and biclique-colouring power graphs
Biclique-colouring is a colouring of the vertices of a graph in such a way that no maximal complete bipartite subgraph with at least one edge is monochromatic. We show that it is coNP-complete to check whether a given function that associates a colour to each vertex is a bicliquecolouring, a result that justifies the search for structured classes where the biclique-colouring problem could be ef...
متن کامل