Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871072 | Discrete Applied Mathematics | 2018 | 10 Pages |
Abstract
We show that weighted 2-CR 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 32 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 54, 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 an O(|E|)+2O(klogk) time algorithm for parameterized 2-CR.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz,