Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings.
Luca BecchettiMiriam Di IanniAlberto Marchetti-SpaccamelaPublished in: FSTTCS (1999)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- scheduling problem
- special case
- vertex cover
- packet switching
- worst case
- network design problem
- minimum cost
- resource constraints
- facility location problem
- resource allocation
- scheduling algorithm
- routing algorithm
- switched networks
- constant factor
- randomized algorithms
- primal dual
- disjoint paths
- approximation schemes
- parallel machines
- open shop
- approximation ratio
- set cover
- np hardness
- routing problem
- routing protocol
- wireless sensor networks
- parallel processors
- sequence dependent setup times
- objective function
- combinatorial auctions
- quality of service
- computational complexity