Approximation Algorithms for Budget Constrained Network Upgradeable Problems.
Debjyoti SaharoySandeep SenPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- vertex cover
- network design problem
- np hardness
- randomized algorithms
- approximation schemes
- special case
- np hard
- exact algorithms
- lower bound
- worst case
- optimization problems
- minimum cost
- disjoint paths
- facility location problem
- network structure
- network design
- combinatorial optimization
- constant factor
- metaheuristic
- np complete
- evolutionary algorithm