Approximation Algorithms for Layered Multicast Scheduling.
Qingbo CaiVincenzo LiberatorePublished in: ISAAC (2005)
Keyphrases
- setup times
- approximation algorithms
- precedence constraints
- scheduling problem
- np hard
- single machine scheduling problem
- special case
- vertex cover
- worst case
- minimum cost
- set cover
- wireless networks
- np hardness
- network design problem
- approximation schemes
- primal dual
- facility location problem
- constant factor
- approximation ratio
- routing algorithm
- scheduling algorithm
- disjoint paths
- job shop
- randomized algorithms
- constant factor approximation
- genetic algorithm
- resource constraints
- open shop