Improved approximation algorithms for hitting 3-vertex paths.
Samuel FioriniGwenaël JoretOliver SchaudtPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- undirected graph
- disjoint paths
- special case
- np hard
- facility location problem
- worst case
- minimum cost
- approximation ratio
- set cover
- randomized algorithms
- network design problem
- vertex cover
- exact algorithms
- approximation schemes
- primal dual
- polynomial time approximation
- precedence constraints
- constant factor
- computational complexity
- markov chain
- lower bound