Parameterized Power Vertex Cover

DOI10.1007/978-3-662-53536-3_9zbMath1417.05157arXiv1801.10476MaRDI QIDQ3181050

Eric Angel, Michael Lampis, Bruno Escoffier, Evripidis Bampis

Publication date: 22 December 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

treewidth; parameterized complexity; parameterized approximation; power vertex cover

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms