Approximation Algorithms for Survivable Optical Networks.
Tamar EilamShlomo MoranShmuel ZaksPublished in: DISC (2000)
Keyphrases
- approximation algorithms
- optical networks
- special case
- np hard
- routing and wavelength assignment
- wavelength division multiplexing
- service differentiation
- vertex cover
- minimum cost
- worst case
- approximation ratio
- primal dual
- set cover
- open shop
- network design problem
- wireless networks
- constant factor
- general purpose
- dynamic reconfiguration