Robert Engström ; Tommy Färnqvist ; Peter Jonsson ; Johan Thapper - An approximability-related parameter on graphs―-properties and applications

dmtcs:2118 - Discrete Mathematics & Theoretical Computer Science, February 5, 2015, Vol. 17 no. 1 -
An approximability-related parameter on graphs―-properties and applications

Authors: Robert Engström 1; Tommy Färnqvist 1; Peter Jonsson 1; Johan Thapper 2

We introduce a binary parameter on optimisation problems called separation. The parameter is used to relate the approximation ratios of different optimisation problems; in other words, we can convert approximability (and non-approximability) result for one problem into (non)-approximability results for other problems. Our main application is the problem (weighted) maximum H-colourable subgraph (Max H-Col), which is a restriction of the general maximum constraint satisfaction problem (Max CSP) to a single, binary, and symmetric relation. Using known approximation ratios for Max k-cut, we obtain general asymptotic approximability results for Max H-Col for an arbitrary graph H. For several classes of graphs, we provide near-optimal results under the unique games conjecture. We also investigate separation as a graph parameter. In this vein, we study its properties on circular complete graphs. Furthermore, we establish a close connection to work by Šámal on cubical colourings of graphs. This connection shows that our parameter is closely related to a special type of chromatic number. We believe that this insight may turn out to be crucial for understanding the behaviour of the parameter, and in the longer term, for understanding the approximability of optimisation problems such as Max H-Col.

Volume: Vol. 17 no. 1
Section: Graph Theory
Published on: February 5, 2015
Submitted on: April 14, 2012
Keywords: graph H-colouring,approximation,graph homomorphism,circular colouring,combinatorial optimisation,graph theory,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Source : OpenAIRE Graph
  • Constraint Satisfaction Problems: Algorithms and Complexity; Funder: European Commission; Code: 257039

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1145/258533.258536
Source : ScholeXplorer IsRelatedTo DOI 10.1145/502090.502098
  • 10.1145/258533.258536
  • 10.1145/502090.502098
Some optimal inapproximability results

Consultation statistics

This page has been seen 365 times.
This article's PDF has been downloaded 297 times.