Approximation Algorithms for Traffic Grooming in WDM Rings.
Kevin CorcoranSeth R. FlaxmanMark NeyerPeter ScherpelzCraig WeidertRan Libeskind-HadasPublished in: ICC (2009)
Keyphrases
- approximation algorithms
- mesh network
- np hard
- wavelength division multiplexing
- routing and wavelength assignment
- special case
- blocking probability
- vertex cover
- wdm networks
- worst case
- network traffic
- minimum cost
- primal dual
- optical networks
- np hardness
- facility location problem
- set cover
- constant factor
- traffic flow
- approximation ratio
- randomized algorithms
- approximation schemes
- link failure
- network design problem
- constant factor approximation
- open shop
- precedence constraints
- integrality gap
- approximation guarantees
- wireless mesh networks
- undirected graph
- combinatorial auctions
- road network
- upper bound