Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.
Peiyan ZhouHaitao JiangDaming ZhuBinhai ZhuPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- approximation algorithms
- undirected graph
- bounded degree
- np hard
- graph theoretic
- special case
- minimum cost
- worst case
- vertex cover
- set cover
- facility location problem
- disjoint paths
- open shop
- approximation ratio
- bounded treewidth
- primal dual
- precedence constraints
- directed graph
- constant factor
- randomized algorithms
- polynomial time approximation
- spanning tree
- approximation guarantees
- linear programming
- integrality gap
- graph matching