3,452 research outputs found

    Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems

    Get PDF
    In the {\sc Hitting Set} problem, we are given a collection F\cal F of subsets of a ground set VV and an integer pp, and asked whether VV has a pp-element subset that intersects each set in F\cal F. We consider two parameterizations of {\sc Hitting Set} below tight upper bounds: p=mkp=m-k and p=nkp=n-k. In both cases kk is the parameter. We prove that the first parameterization is fixed-parameter tractable, but has no polynomial kernel unless coNP\subseteqNP/poly. The second parameterization is W[1]-complete, but the introduction of an additional parameter, the degeneracy of the hypergraph H=(V,F)H=(V,{\cal F}), makes the problem not only fixed-parameter tractable, but also one with a linear kernel. Here the degeneracy of H=(V,F)H=(V,{\cal F}) is the minimum integer dd such that for each XVX\subset V the hypergraph with vertex set VXV\setminus X and edge set containing all edges of F\cal F without vertices in XX, has a vertex of degree at most d.d. In {\sc Nonblocker} ({\sc Directed Nonblocker}), we are given an undirected graph (a directed graph) GG on nn vertices and an integer kk, and asked whether GG has a set XX of nkn-k vertices such that for each vertex y∉Xy\not\in X there is an edge (arc) from a vertex in XX to yy. {\sc Nonblocker} can be viewed as a special case of {\sc Directed Nonblocker} (replace an undirected graph by a symmetric digraph). Dehne et al. (Proc. SOFSEM 2006) proved that {\sc Nonblocker} has a linear-order kernel. We obtain a linear-order kernel for {\sc Directed Nonblocker}

    Parameterized Study of the Test Cover Problem

    Full text link
    We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\sc Test Cover} problem we are given a set [n]={1,...,n}[n]=\{1,...,n\} of items together with a collection, T\cal T, of distinct subsets of these items called tests. We assume that T\cal T is a test cover, i.e., for each pair of items there is a test in T\cal T containing exactly one of these items. The objective is to find a minimum size subcollection of T\cal T, which is still a test cover. The generic parameterized version of {\sc Test Cover} is denoted by p(k,n,T)p(k,n,|{\cal T}|)-{\sc Test Cover}. Here, we are given ([n],T)([n],\cal{T}) and a positive integer parameter kk as input and the objective is to decide whether there is a test cover of size at most p(k,n,T)p(k,n,|{\cal T}|). We study four parameterizations for {\sc Test Cover} and obtain the following: (a) kk-{\sc Test Cover}, and (nk)(n-k)-{\sc Test Cover} are fixed-parameter tractable (FPT). (b) (Tk)(|{\cal T}|-k)-{\sc Test Cover} and (logn+k)(\log n+k)-{\sc Test Cover} are W[1]-hard. Thus, it is unlikely that these problems are FPT

    Tight Kernel Bounds for Problems on Graphs with Small Degeneracy

    Full text link
    In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most dd. This graph class generalizes many classes of graphs for which effective kernelization is known to exist, e.g. planar graphs, H-minor free graphs, and H-topological-minor free graphs. We show that for several natural problems on d-degenerate graphs the best known kernelization upper bounds are essentially tight.Comment: Full version of ESA 201

    The Graph Motif problem parameterized by the structure of the input graph

    Full text link
    The Graph Motif problem was introduced in 2006 in the context of biological networks. It consists of deciding whether or not a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Graph Motif has been mostly analyzed from the standpoint of parameterized complexity. The main parameters which came into consideration were the size of the multiset and the number of colors. Though, in the many applications of Graph Motif, the input graph originates from real-life and has structure. Motivated by this prosaic observation, we systematically study its complexity relatively to graph structural parameters. For a wide range of parameters, we give new or improved FPT algorithms, or show that the problem remains intractable. For the FPT cases, we also give some kernelization lower bounds as well as some ETH-based lower bounds on the worst case running time. Interestingly, we establish that Graph Motif is W[1]-hard (while in W[P]) for parameter max leaf number, which is, to the best of our knowledge, the first problem to behave this way.Comment: 24 pages, accepted in DAM, conference version in IPEC 201

    Parameterization Above a Multiplicative Guarantee

    Get PDF
    Parameterization above a guarantee is a successful paradigm in Parameterized Complexity. To the best of our knowledge, all fixed-parameter tractable problems in this paradigm share an additive form defined as follows. Given an instance (I,k) of some (parameterized) problem ? with a guarantee g(I), decide whether I admits a solution of size at least (at most) k+g(I). Here, g(I) is usually a lower bound (resp. upper bound) on the maximum (resp. minimum) size of a solution. Since its introduction in 1999 for Max SAT and Max Cut (with g(I) being half the number of clauses and half the number of edges, respectively, in the input), analysis of parameterization above a guarantee has become a very active and fruitful topic of research. We highlight a multiplicative form of parameterization above a guarantee: Given an instance (I,k) of some (parameterized) problem ? with a guarantee g(I), decide whether I admits a solution of size at least (resp. at most) k ? g(I). In particular, we study the Long Cycle problem with a multiplicative parameterization above the girth g(I) of the input graph, and provide a parameterized algorithm for this problem. Apart from being of independent interest, this exemplifies how parameterization above a multiplicative guarantee can arise naturally. We also show that, for any fixed constant ?>0, multiplicative parameterization above g(I)^(1+?) of Long Cycle yields para-NP-hardness, thus our parameterization is tight in this sense. We complement our main result with the design (or refutation of the existence) of algorithms for other problems parameterized multiplicatively above girth
    corecore