A Kernel for Convex Recoloring of Weighted Forests

Authors:
Hans L. Bodlaender;Marc Comas
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 8
Cited 0

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization

ACM SIGACT News
A 2O (k)poly(n) algorithm for the parameterized Convex Recoloring problem

Information Processing Letters
Efficient approximation of convex recolorings

Journal of Computer and System Sciences
Improved Approximation Algorithm for Convex Recoloring of Trees

Theory of Computing Systems
Convex recolorings of strings and trees: Definitions, hardness results and algorithms

Journal of Computer and System Sciences
Speeding up dynamic programming for some NP-hard graph recoloring problems

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Quadratic kernelization for convex recoloring of trees

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that the following problem has a kernel of quadratic size: given is a tree T whose vertices have been assigned colors and a non-negative integer weight, and given is an integer k. In a recoloring, the color of some vertices is changed. We are looking for a recoloring such that each color class induces a subtree of T and such that the total weight of all recolored vertices is at most k. Our result generalizes a result by Bodlaender et al. [3] who give quadratic size kernel for the case that all vertices have unit weight.