Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks.
Krzysztof CiebieraPiotr GodlewskiPiotr SankowskiPiotr WygockiPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- vertex cover
- steiner tree
- approximation schemes
- minimum cost
- network design problem
- np hard
- randomized algorithms
- special case
- np complete
- worst case
- optimal solution
- disjoint paths
- integer programming
- primal dual
- mixed integer programming
- cutting plane
- mathematical model
- optimization problems