You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Warwick » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Warwick

Return to search Previous output Next output

Output 8 of 99 in the submission

Article title

A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing

Type

D - Journal article

DOI

10.1137/080736831

Title of journal

SIAM Journal on Computing

Article number

Volume number

Issue number

First page of article

1256

ISSN of journal

0097-5397

Year of publication

2009

URL

http://epubs.siam.org/doi/abs/10.1137/080736831

Number of additional authors

Additional information

<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.

Interdisciplinary

Cross-referral requested

Research group

T - Theory and Foundations

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract