Approximation Algorithms for Register Allocation
Klaus JansenJoachim ReiterPublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Keyphrases
- approximation algorithms
- combinatorial auctions
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- approximation schemes
- facility location problem
- set cover
- network design problem
- constant factor
- primal dual
- resource allocation
- approximation ratio
- objective function
- randomized algorithms
- open shop
- strongly np hard
- parallel machines
- exact algorithms
- integer programming
- error bounds
- lower bound
- optimal solution