Improved approximation algorithms for broadcast scheduling.
Nikhil BansalDon CoppersmithMaxim SviridenkoPublished in: SODA (2006)
Keyphrases
- approximation algorithms
- broadcast scheduling
- special case
- np hard
- vertex cover
- minimum cost
- worst case
- network design problem
- primal dual
- np hardness
- approximation ratio
- open shop
- randomized algorithms
- facility location problem
- set cover
- constant factor
- approximation schemes
- approximation guarantees
- constant factor approximation
- precedence constraints
- exact algorithms
- undirected graph
- disjoint paths
- genetic algorithm