# 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

#### References

SHOWING 1-10 OF 50 REFERENCES
A Completeness Theory for Polynomial (Turing) Kernelization
• Mathematics, Computer Science
• Algorithmica
• 2014
A Hierarchy of Polynomial Kernels
• Mathematics, Computer Science
• SOFSEM
• 2019
(Meta) Kernelization
• Mathematics, Computer Science
• 2009 50th Annual IEEE Symposium on Foundations of Computer Science
• 2009
Infeasibility of instance compression and succinct PCPs for NP
• Computer Science, Mathematics
• Electron. Colloquium Comput. Complex.
• 2007
On problems without polynomial kernels
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2009
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
• Mathematics, Computer Science
• 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
• 2012