A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
From MaRDI portal
Publication:4606331
DOI10.4230/LIPIcs.ESA.2016.59zbMath1397.68103arXiv1611.06795OpenAlexW2948443822MaRDI QIDQ4606331
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1611.06795
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20)
Related Items (6)
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ⋮ Unnamed Item ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition ⋮ Rank Vertex Cover as a Natural Problem for Algebraic Compression ⋮ Polynomial kernels for vertex cover parameterized by small degree modulators ⋮ Smaller Parameters for Vertex Cover Kernelization
This page was built for publication: A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
