Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.
Mohammad Hossein BateniMohammad Taghi HajiaghayiVahid LiaghatPublished in: SIAM J. Comput. (2018)
Keyphrases
- approximation algorithms
- vertex cover
- np hardness
- np hard
- network design problem
- randomized algorithms
- special case
- exact algorithms
- disjoint paths
- approximation schemes
- optimal solution
- evolutionary algorithm
- practical problems
- undirected graph
- facility location problem
- linear programming
- polynomial time approximation
- multi class
- open shop
- computational complexity