Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs

DOI10.1016/j.tcs.2021.07.015OpenAlexW3184115741MaRDI QIDQ820559

Haitao Jiang, Daming Zhu, Peiyan Zhou, Binhai Zhu

Publication date: 27 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.015

zbMATH Keywords

approximationcubic graphmaximum vertex coverage

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximation properties of the independent set problem for low degree graphs
• The hardness of approximation: Gap location
• The budgeted maximum coverage problem
• Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
• The maximum vertex coverage problem on bipartite graphs
• Approximating low-dimensional coverage problems
• Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs
• On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
• The importance of being biased
• Minconvex Factors of Prescribed Size in Graphs
• Reducibility among Combinatorial Problems
• On approximation properties of the Independent set problem for degree 3 graphs
• The complexity of theorem-proving procedures

This page was built for publication: Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs