Hardness of Approximation for Vertex-Connectivity Network Design Problems.
Guy KortsarzRobert KrauthgamerJames R. LeePublished in: SIAM J. Comput. (2004)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- worst case
- special case
- network design
- network flow problem
- minimal cost
- minimum cost
- np complete
- lower bound
- mixed integer programming
- primal dual
- computational complexity
- mixed integer
- integer programming
- branch and bound
- upper bound
- phase transition
- lagrangian relaxation
- particle swarm optimization
- valid inequalities
- supply chain
- genetic algorithm