The minimum generalized vertex cover problem

DOI10.1145/1125994.1125998zbMath1321.05204OpenAlexW2002809037MaRDI QIDQ2944506

Refael Hassin, Asaf Levin

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1125994.1125998

zbMATH Keywords

vertex coverlocal ratiocomplexity classification

Mathematics Subject Classification ID

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

Related Items (5)

Approximating power node-deletion problems ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Exact solutions to generalized vertex covering problems: a comparison of two models ⋮ The generalized vertex cover problem and some variations ⋮ Min sum clustering with penalties

This page was built for publication: The minimum generalized vertex cover problem