Approximation algorithms for grooming in optical network design.
Spyridon AntonakopoulosLisa ZhangPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- approximation algorithms
- network design
- network design problem
- switched networks
- np hard
- special case
- communication networks
- minimum cost
- vertex cover
- worst case
- facility location
- network architecture
- set cover
- primal dual
- randomized algorithms
- approximation ratio
- open shop
- genetic algorithm
- approximation guarantees
- disjoint paths
- constant factor
- precedence constraints
- undirected graph
- linear programming
- dynamic programming
- neural network
- constant factor approximation