Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Luca BecchettiMiriam Di IanniAlberto Marchetti-SpaccamelaPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- vertex cover
- scheduling problem
- packet switching
- minimum cost
- worst case
- facility location problem
- switched networks
- routing problem
- primal dual
- network design problem
- scheduling algorithm
- approximation ratio
- np hardness
- open shop
- shortest path
- resource constraints
- resource allocation
- set cover
- parallel processors
- approximation schemes
- routing algorithm
- routing protocol
- single machine scheduling problem
- constant factor
- approximation guarantees
- job shop
- parallel machines
- randomized algorithms
- polynomial time approximation
- optimal solution
- learning algorithm