Approximation algorithms for a virtual machine allocation problem with finite types.
Lifeng GuoChanghong LuGuanlin WuPublished in: Inf. Process. Lett. (2023)
Keyphrases
- approximation algorithms
- virtual machine
- np hard
- special case
- worst case
- operating system
- vertex cover
- minimum cost
- data center
- network design problem
- virtual memory
- facility location problem
- randomized algorithms
- disjoint paths
- approximation schemes
- constant factor
- combinatorial auctions
- approximation ratio
- cloud computing environment
- open shop
- multi tasking
- precedence constraints
- polynomial time approximation
- np hardness
- data analysis
- primal dual
- finite number
- cost effective
- lower bound