Kernel(s) for problems with no kernel
From MaRDI portal
Recommendations
- \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves
- A linear-time kernelization for the rooted k-leaf outbranching problem
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
- scientific article; zbMATH DE number 6739965
- Kernel treelets
- Kernelization for maximum leaf spanning tree with positive vertex weights
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
- Kernels and Grundy functions on trees
- Approximate tree kernels
- A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
Cited in
(32)- On some FPT problems without polynomial Turing compressions
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Reoptimization of parameterized problems
- Turing kernelization for finding long paths in graph classes excluding a topological minor
- A completeness theory for polynomial (Turing) kernelization
- A linear-time kernelization for the rooted k-leaf outbranching problem
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Linear kernels for outbranching problems in sparse digraphs
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- How heavy independent sets help to find arborescences with many leaves in DAGs
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
- Basic Terminology, Notation and Results
- Parameterized algorithms for non-separating trees and branchings in digraphs
- A \(9k\) kernel for nonseparating independent set in planar graphs
- Preprocessing subgraph and minor problems: when does a small vertex cover help?
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Turing kernelization for finding long paths in graphs excluding a topological minor
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- scientific article; zbMATH DE number 6739965 (Why is no real title available?)
- \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Approximate Turing Kernelization for Problems Parameterized by Treewidth
- Kernelization for maximum leaf spanning tree with positive vertex weights
- Parameterized certificate dispersal and its variants
- Leafy spanning arborescences in DAGs
- K-distinct branchings admits a polynomial kernel
- Approximate Turing kernelization for problems parameterized by treewidth
- Approximate Turing kernelization and lower bounds for domination problems
- Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs
- A 4/3-approximation for the maximum leaf spanning arborescence problem in DAGs
- A \(\frac{4}{3}\)-approximation for the maximum leaf spanning arborescence problem in DAGs
This page was built for publication: Kernel(s) for problems with no kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189081)
