When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.
Ali MashreghiAlireza ZareiPublished in: Theory Comput. Syst. (2016)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- maximum distance
- special case
- worst case
- vertex cover
- facility location problem
- open shop
- primal dual
- approximation schemes
- randomized algorithms
- network design problem
- np hardness
- search space
- precedence constraints
- exact algorithms
- scheduling problem
- constant factor approximation