# Approximate Turing Kernelization for Problems Parameterized by Treewidth

@inproceedings{Hols2020ApproximateTK,
title={Approximate Turing Kernelization for Problems Parameterized by Treewidth},
author={Eva-Maria C. Hols and Stefan Kratsch and A. Pieterse},
booktitle={ESA},
year={2020}
}
• Published in ESA 2020
• Computer Science, Mathematics
We extend the notion of lossy kernelization, introduced by Lokshtanov et al. [STOC 2017], to approximate Turing kernelization. An $\alpha$-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 $(\alpha \cdot 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… Expand
1 Citations
FPT-approximation for FPT Problems
• Computer Science
• SODA
• 2021
This paper designs FPT-approximation algorithms for problems that are FPT, with running times that are significantly faster than the corresponding best known FPT -algorithm, and while achieving approximation ratios that are significant better than what is possible in polynomial time. Expand

#### References

SHOWING 1-10 OF 50 REFERENCES
A Completeness Theory for Polynomial (Turing) Kernelization
• Mathematics, Computer Science
• Algorithmica
• 2014
This work conjecture that no WK[1]-hard problem admits a polynomial Turing kernel, and defines two kernelization hardness hierarchies which are akin to the M- and W-hierarchies of parameterized complexity. Expand
On Kernelization for Edge Dominating Set under Structural Parameters
• Mathematics, Computer Science
• STACS
• 2019
This work fully classify for all finite sets of graphs whether a kernel size polynomial in $|X|$ is possible when given $X$ such that each connected component of $G-X$ is isomorphic to a graph in $\mathcal{H}$. Expand
A Hierarchy of Polynomial Kernels
• Mathematics, Computer Science
• SOFSEM
• 2019
It is shown that Turing kernelizations differ not only from regular kernelization, but also from intermediate forms as truth-table kernelizations, and improves on known lower bounds for the kernel size of compositional problems using these assumptions. Expand
(Meta) Kernelization
• Mathematics, Computer Science
• 2009 50th Annual IEEE Symposium on Foundations of Computer Science
• 2009
The theorems unify and extend all previously known kernelization results for planar graph problems and show that all problems expressible in Counting Monadic Second Order Logic and satisfying a compactness property admit a polynomial kernel on graphs of bounded genus. Expand
Infeasibility of instance compression and succinct PCPs for NP
• Computer Science, Mathematics
• Electron. Colloquium Comput. Complex.
• 2007
A new strong derandomization hypothesis is introduced, the Oracle Derandomization Hypothesis, and how it relates to traditional derandomizing assumptions is discussed, and various results about and connections between these variants are shown. Expand
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations
• Mathematics, Computer Science
• ESA
• 2018
It is proved that for each set F of connected graphs and constant $\eta$, the F-Deletion problem parameterized by the size of a treedepth-one modulator has a polynomial kernel. Expand
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
• Mathematics, Computer Science
• Algorithmica
• 2015
The main result in this paper is to show the existence of an FPT algorithm when the authors parameterize the problem by the solution size k, and it is proved that the chromatic number of a bull-free graph is bounded by a function of its clique number and the maximum chromatics number of its triangle-free induced subgraphs. Expand
On problems without polynomial kernels
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2009
Using the notion of distillation algorithms, a generic lower-bound engine is developed that allows showing that a variety of FPT problems, fulfilling certain criteria, cannot have polynomial kernels unless the polynomially-bounded hierarchy collapses. Expand
Lossy Kernels for Connected Dominating Set on Sparse Graphs
• Mathematics, Computer Science
• STACS
• 2018
It is shown that even though the kernelization complexity ofDominating Set and Connected Dominating Set diverges on sparse graphs this divergence is not as extreme as kernelization lower bounds suggest. Expand
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
• Mathematics, Computer Science
• 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
• 2012
This work applies the representative sets tool to the problem of finding irrelevant vertices in graph cut problems, that is, vertices which can be made undeletable without affecting the status of the problem, and gives the first significant progress towards a polynomial kernel for the Multiway Cut problem. Expand