Approximate Turing kernelization and lower bounds for domination problems
From MaRDI portal
Cites work
- A completeness theory for polynomial (Turing) kernelization
- A Greedy Heuristic for the Set-Covering Problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximate Turing Kernelization for Problems Parameterized by Treewidth
- Approximating the minimum maximal independence number
- Approximation algorithms for connected dominating sets
- Approximation hardness of dominating set problems in bounded degree graphs
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Kernel(s) for problems with no kernel
- Kernelization lower bounds through colors and IDs
- Kernelization. Theory of parameterized preprocessing
- Lossy kernelization
- On approximating the minimum independent dominating set
- On the complexity of k-SAT
- Parameterized approximation via fidelity preserving transformations
- Parameterized complexity of vertex deletion into perfect graph classes
- Treewidth. Computations and approximations
- Turing kernelization for finding long paths and cycles in restricted graph classes
- Turing kernelization for finding long paths in graphs excluding a topological minor
- Wheel-Free Deletion Is W[2]-Hard
Cited in
(2)
This page was built for publication: Approximate Turing kernelization and lower bounds for domination problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926175)
