On the approximate compressibility of connected vertex cover

DOI10.1007/s00453-020-00708-4zbMath1455.68144arXiv1905.03379MaRDI QIDQ2006945

M. S. Ramanujan, Saket Saurabh, Diptapriyo Majumdar

Publication date: 12 October 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.03379

zbMATH Keywords

parameterized complexity; kernelization; connected vertex cover; approximate kernelization

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q27: Parameterized complexity, tractability and kernelization