Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.
Andreas Emil FeldmannJochen KönemannKanstantsin PashkovichLaura SanitàPublished in: ISAAC (2016)
Keyphrases
- network design problem
- approximation algorithms
- np hard
- special case
- worst case
- facility location problem
- minimum cost
- vertex cover
- exact algorithms
- primal dual
- lower bound
- constant factor
- network design
- computational complexity
- transportation networks
- approximation ratio
- combinatorial auctions
- constant factor approximation