Parameterized reductions and algorithms for another vertex cover generalization
Paper in proceedings, 2011

We study a novel generalization of the Vertex Cover problem which is motivated by, e.g., error correction in the inference of chemical mixtures by their observable reaction products. We focus on the important case of deciding on one of two candidate substances. This problem has nice graph-theoretic formulations situated between Vertex Cover and 3-Hitting Set. In order to characterize their parameterized complexity we devise parameter-preserving reductions, and we show that some minimum solution can be computed faster than by solving 3-Hitting Set in general. More explicitly, we introduce the Union Editing problem: In a hypergraph with red and blue vertices, edit the colors so that the red set becomes the union of some hyperedges. The case of degree 2 is equivalent to Star Editing: In a graph with red and blue edges, edit the colors so that the red set becomes the union of some stars, i.e., vertices with all their incident edges.

vertex cover

error correction

problem kernel

graph editing

parameterized complexity

hitting set

Author

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Leonid Molokov

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 6844 279-289

Roots

Basic sciences

Subject Categories

Computer Science

DOI

10.1007/978-3-642-22300-6_24

ISBN

978-3-642-22299-3

More information

Created

10/7/2017