Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs.
An ZhangYong ChenZhi-Zhong ChenGuohui LinPublished in: Algorithmica (2020)
Keyphrases
- approximation algorithms
- undirected graph
- minimum cost
- special case
- np hard
- disjoint paths
- vertex cover
- strongly connected
- directed graph
- facility location problem
- approximation ratio
- spanning tree
- worst case
- network design problem
- attributed graphs
- set cover
- edge weights
- constant factor
- primal dual
- approximation schemes
- open shop
- randomized algorithms
- precedence constraints
- strongly np hard
- approximation guarantees
- minimum weight
- labeled graphs
- shortest path
- finite number