Efficient Algorithms for the max k -vertex cover Problem

DOI10.1007/978-3-642-33475-7_21zbMath1362.68105OpenAlexW1597165385MaRDI QIDQ2915177

Vangelis Th. Paschos, Frederico Della Croce

Publication date: 21 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33475-7_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}

This page was built for publication: Efficient Algorithms for the max k -vertex cover Problem