scientific article; zbMATH DE number 7525514
From MaRDI portal
Publication:5075825
DOI10.4230/LIPIcs.ESA.2019.77MaRDI QIDQ5075825
No author found.
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
On the lossy kernelization for connected treedepth deletion set ⋮ \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms ⋮ Circumventing connectivity for kernelization ⋮ Approximate Turing Kernelization for Problems Parameterized by Treewidth ⋮ On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infeasibility of instance compression and succinct PCPs for NP
- FPT algorithms for connected feedback vertex set
- On problems without polynomial kernels
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- A completeness theory for polynomial (Turing) kernelization
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Kernelization – Preprocessing with a Guarantee
- Lossy Kernels for Connected Dominating Set on Sparse Graphs
- New Limits to Classical and Quantum Instance Compression
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Kernelization Lower Bounds Through Colors and IDs
- Lossy kernelization
- Lossy Kernels for Hitting Subgraphs
- Parameterized Algorithms
- Connected Feedback Vertex Set in Planar Graphs
This page was built for publication:
