Approximate Turing Kernelization for Problems Parameterized by Treewidth

by   Eva-Maria C. Hols, et al.

We extend the notion of lossy kernelization, introduced by Lokshtanov et al. [STOC 2017], to approximate Turing kernelization. An α-approximate Turing kernel for a parameterized optimization problem is a polynomial-time algorithm that, when given access to an oracle that outputs c-approximate solutions in O(1) time, obtains an (α· c)-approximate solution to the considered problem, using calls to the oracle of size at most f(k) for some function f that only depends on the parameter. Using this definition, we show that Independent Set parameterized by treewidth ℓ has a (1+ε)-approximate Turing kernel with O(ℓ^2/ε) vertices, answering an open question posed by Lokshtanov et al. [STOC 2017]. Furthermore, we give (1+ε)-approximate Turing kernels for the following graph problems parameterized by treewidth: Vertex Cover, Edge Clique Cover, Edge-Disjoint Triangle Packing and Connected Vertex Cover. We generalize the result for Independent Set and Vertex Cover, by showing that all graph problems that we will call "friendly" admit (1+ε)-approximate Turing kernels of polynomial size when parameterized by treewidth. We use this to obtain approximate Turing kernels for Vertex-Disjoint H-packing for connected graphs H, Clique Cover, Feedback Vertex Set and Edge Dominating Set.



There are no comments yet.


page 1

page 2

page 3

page 4


On the Approximate Compressibility of Connected Vertex Cover

The Connected Vertex Cover problem, where the goal is to compute a minim...

Reoptimization of Parameterized Problems

Parameterized complexity allows us to analyze the time complexity of pro...

Polynomial Turing Kernels for Clique with an Optimal Number of Queries

A polynomial Turing kernel for some parameterized problem P is a polynom...

On r-Simple k-Path and Related Problems Parameterized by k/r

Abasi et al. (2014) and Gabizon et al. (2015) studied the following prob...

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

In the Group Steiner Tree problem (GST), we are given a (vertex or edge)...

On Structural Parameterizations of the Edge Disjoint Paths Problem

In this paper we revisit the classical Edge Disjoint Paths (EDP) problem...

Parameterized Power Vertex Cover

We study a recently introduced generalization of the Vertex Cover (VC) p...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.