Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling.
Brian C. DeanMichel X. GoemansPublished in: ICALP (2003)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- precedence constraints
- special case
- vertex cover
- scheduling problem
- worst case
- network design problem
- facility location problem
- primal dual
- approximation ratio
- search space
- scheduling algorithm
- np hardness
- set cover
- open shop
- disjoint paths
- randomized algorithms
- spanning tree
- polynomial time approximation
- approximation schemes
- theoretical analysis