Hitting forbidden minors: approximation and kernelization
From MaRDI portal
Recommendations
Cited in
(34)- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Linear kernels for separating a graph into components of bounded size
- On the hardness of losing width
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach
- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\)
- Hitting forbidden minors: approximation and kernelization
- On polynomial kernels for structural parameterizations of odd cycle transversal
- On the hardness of losing width
- Kernelization -- preprocessing with a guarantee
- Graph minors and parameterized algorithm design
- Generalized pseudoforest deletion: algorithms and uniform kernel
- Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation)
- Parameterized complexity of vertex deletion into perfect graph classes
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Kernelization using structural parameters on sparse graph classes
- Parameterized complexity of vertex deletion into perfect graph classes
- Generalized pseudoforest deletion: algorithms and uniform kernel
- Confronting intractability via parameters
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.
- Forbidden directed minors and Kelly-width
- Linear kernels for edge deletion problems to immersion-closed graph classes
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- A constant-factor approximation for weighted bond cover
- On parameterized independent feedback vertex set
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
This page was built for publication: Hitting forbidden minors: approximation and kernelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113683)
