Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem
Evripidis BampisGiorgio LucarelliIoannis NemparisPublished in: CoRR (2012)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- approximation ratio
- vertex cover
- lower bound
- scheduling problem
- facility location problem
- np hardness
- set cover
- open shop
- combinatorial auctions
- primal dual
- network design problem
- exact algorithms
- approximation schemes
- undirected graph
- precedence constraints
- randomized algorithms
- single machine
- disjoint paths
- scheduling algorithm