Improved approximation algorithms for path vertex covers in regular graphs.
An ZhangYong ChenZhi-Zhong ChenGuohui LinPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- undirected graph
- minimum cost
- np hard
- disjoint paths
- special case
- worst case
- vertex cover
- facility location problem
- set cover
- directed graph
- primal dual
- network design problem
- strongly connected
- spanning tree
- np hardness
- approximation ratio
- approximation schemes
- edge weights
- constant factor
- approximation guarantees
- attributed graphs
- precedence constraints
- linear programming
- graph matching
- labeled graphs
- constant factor approximation
- open shop
- bipartite graph
- minimum weight
- graph structure
- combinatorial auctions