Output details
11 - Computer Science and Informatics
University of Warwick
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
<12> This paper, in one of the top journals in theoretical computer science, presents the best-known approximation algorithms for multi-dimensional bin packing problems, based on a new general technique for classical set covering problems. This work is of great theoretical and practical interest, with diverse applications including cloud computing (Casanova, Hawaii; Vivien, INRIA; Dutta, IBM Research), multi-processor scheduling (Niemeier, EPFL) and virtualised data centres (Speitkamp, Munich/Siemens; Guo, Bell Labs). The techniques have also been used in strip packing (van Stee, Max Planck), bin/cube packing (Epstein, U. Haifa; Levin, Technion), and vector packing (Otoo, LBNL; Pinar, SNL). EPSRC EP/J021814/1 extends this research.