Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems.
MohammadHossein BateniMohammadTaghi HajiaghayiVahid LiaghatPublished in: ICALP (1) (2013)
Keyphrases
- approximation algorithms
- vertex cover
- special case
- np hardness
- exact algorithms
- np hard
- randomized algorithms
- network design problem
- worst case
- approximation schemes
- disjoint paths
- facility location problem
- set cover
- minimum cost
- precedence constraints
- constant factor
- greedy algorithm
- complex networks
- multi class
- evolutionary algorithm