Preprocessing to reduce the search space: antler structures for feedback vertex set
From MaRDI portal
Cites work
- (Meta) kernelization
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A 4k^2 kernel for feedback vertex set
- A completeness theory for polynomial (Turing) kernelization
- A cubic kernel for feedback vertex set and loop cutset
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- Bilu-Linial stability, certified algorithms and the independent set problem
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Center-based clustering under perturbation stability
- Color-coding
- Crown structures for vertex cover kernelization
- Dynamic programming algorithms for the zero-one knapsack problem
- Faster parameterized algorithms using linear programming
- Fundamentals of parameterized complexity
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- Improved analysis of highest-degree branching for feedback vertex set
- Improved upper bounds for vertex cover
- Infeasibility of instance compression and succinct PCPs for NP
- Kernelization Lower Bounds by Cross-Composition
- Kernelization. Theory of parameterized preprocessing
- Linear-time kernelization for feedback vertex set
- Mixed integer programming: analyzing 12 years of progress
- Network sparsification for Steiner problems on planar and bounded-genus graphs
- New limits to classical and quantum instance compression
- Parameterized algorithms
- Parametrized complexity theory.
- Presolve Reductions in Mixed Integer Programming
- Recent techniques and results on the Erdős-Pósa property
- Reducibility among combinatorial problems
- Representative sets and irrelevant vertices: new tools for kernelization
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
- The Problem of Simplifying Truth Functions
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Vertex packings: Structural properties and algorithms
This page was built for publication: Preprocessing to reduce the search space: antler structures for feedback vertex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564613)
