Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem.
Toshiya MashimaToshimasa WatanabePublished in: ISCAS (1995)
Keyphrases
- approximation algorithms
- disjoint paths
- undirected graph
- np hard
- special case
- minimum cost
- vertex cover
- facility location problem
- worst case
- open shop
- np hardness
- approximation schemes
- randomized algorithms
- approximation ratio
- precedence constraints
- constant factor
- edge detection
- set cover
- exact algorithms
- network design problem
- connected components
- approximation guarantees
- edge map
- wireless sensor networks
- column generation
- directed graph