Maximum Minimal Vertex Cover Parameterized by Vertex Cover

DOI10.1137/16M109017XzbMath1380.68236MaRDI QIDQ4588848

Meirav Zehavi

Publication date: 2 November 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithm; vertex cover; parameterized algorithm; maximization problem; strong exponential-time hypothesis; SETH

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms