Improved approximation algorithms for hitting 3-vertex paths.
Samuel FioriniGwenaël JoretOliver SchaudtPublished in: Math. Program. (2020)
Keyphrases
- approximation algorithms
- undirected graph
- disjoint paths
- np hard
- special case
- minimum cost
- facility location problem
- vertex cover
- worst case
- open shop
- exact algorithms
- np hardness
- network design problem
- primal dual
- set cover
- constant factor
- markov chain
- precedence constraints
- dynamic programming
- approximation ratio
- upper bound
- randomized algorithms
- approximation schemes
- directed graph
- shortest path