Improved approximation algorithms for Directed Steiner Forest.
Moran FeldmanGuy KortsarzZeev NutovPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- approximation ratio
- facility location problem
- open shop
- exact algorithms
- network design problem
- set cover
- constant factor
- randomized algorithms
- constant factor approximation
- approximation schemes
- np hardness
- primal dual
- undirected graph
- polynomial time approximation
- scheduling problem