Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms.
Sahar TalebiFurqan AlamIyad A. KatibGeorge N. RouskasPublished in: ICNC (2015)
Keyphrases
- approximation algorithms
- worst case
- np hardness
- np hard
- special case
- minimum cost
- vertex cover
- network design problem
- precedence constraints
- constant factor
- approximation ratio
- facility location problem
- approximation schemes
- disjoint paths
- computational complexity
- greedy algorithm
- set cover
- randomized algorithms
- open shop
- error bounds
- combinatorial auctions