1.5-approximation algorithm for the 2-Convex Recoloring problem

Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


Given a graph G = (V,E), a coloring function χ : V → C, assigning each vertex a color, is called convex if, for every color c ∈ C, the set of vertices with color c induces a connected subgraph of G. In the Convex Recoloring problem a colored graph Gχ is given, and the goal is to find a convex coloring χ of G that recolors a minimum number of vertices. The 2-Convex Recoloring problem (2-CR) is the special case, where the given coloring χ assigns the same color to at most two vertices. 2-CR is known to be NP-hard even if G is a path. We show that weighted 2-CR problem cannot be approximated within any ratio, unless P=NP. On the other hand, we provide an alternative definition of (unweighted) 2-CR in terms of maximum independent set of paths, which leads to a natural greedy algorithm. We prove that its approximation ratio is 3/2 and show that this analysis is tight. This is the first constant factor approximation algorithm for a variant of CR in general graphs. For the special case, where G is a path, the algorithm obtains a ratio of 5/4, an improvement over the previous best known approximation. We also consider the problem of determining whether a given graph has a convex recoloring of size k. We use the above mentioned characterization of 2-CR to show that a problem kernel of size 4k can be obtained in linear time and to design a (Formula presented.) time algorithm for parametrized 2-CR.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 26th International Workshop, IWOCA 2015, Revised Selected Papers
EditorsWilliam F. Smyth, Zsuzsanna Liptak
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783319295152
StatePublished - 2016
Event26th International Workshop on Combinatorial Algorithms, IWOCA 2015 - Verona, Italy
Duration: 5 Oct 20157 Oct 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference26th International Workshop on Combinatorial Algorithms, IWOCA 2015

Bibliographical note

Funding Information:
D. Rawitz—Supported in part by the Israel Science Foundation (grant no. 497/14).

Publisher Copyright:
© Springer International Publishing Switzerland 2016.


Dive into the research topics of '1.5-approximation algorithm for the 2-Convex Recoloring problem'. Together they form a unique fingerprint.

Cite this