SIAM Journal on Computing
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Parameterized Complexity of Vertex Cover Variants
Theory of Computing Systems
Parameterized Algorithms for Generalized Domination
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
Optimization-Based Peptide Mass Fingerprinting for Protein Mixture Identification
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Shared Peptides in Mass Spectrometry Based Protein Quantification
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Journal of Discrete Algorithms
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
Parameterized and Exact Computation
Improved upper bounds for vertex cover
Theoretical Computer Science
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
Parameterized Complexity
Hi-index | 5.23 |
We study a novel generalization of the Vertex Cover problem which is motivated by, e.g., error correction (data cleaning) prior to 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 its 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 exactly 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 exactly the union of some stars, i.e., vertices with all their incident edges. Our time bound is O^*(1.84^c) where c denotes the total number of recolored edges.