Approximation Algorithms for Grooming in Optical Network Design.
Spyridon AntonakopoulosLisa ZhangPublished in: INFOCOM (2009)
Keyphrases
- approximation algorithms
- network design
- network design problem
- switched networks
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- approximation ratio
- network architecture
- communication networks
- set cover
- open shop
- primal dual
- facility location
- randomized algorithms
- constant factor
- disjoint paths
- precedence constraints
- undirected graph
- simulated annealing
- constant factor approximation