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