Approximation algorithms for a virtual machine allocation problem with finite types

DOI10.1016/j.ipl.2022.106339OpenAlexW4306804759MaRDI QIDQ2680235

Lifeng Guo, Guanlin Wu, Chang-hong Lu

Publication date: 30 January 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106339

zbMATH Keywords

approximation algorithmscloud computingvector bin packingdivisible item sizesvirtual machine allocation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Bin packing with divisible item sizes
• Optimal energy-efficient placement of virtual machines with divisible sizes
• Algorithms for the variable sized bin packing problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• Integer Programming with a Fixed Number of Variables
• Improved Approximation for Vector Bin Packing
• Algorithms - ESA 2003

This page was built for publication: Approximation algorithms for a virtual machine allocation problem with finite types