For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Warwick

Return to search Previous output Next output
Output 6 of 99 in the submission
Article title

A Harmonic Algorithm for the 3D Strip Packing Problem

Type
D - Journal article
Title of journal
SIAM Journal on Computing
Article number
-
Volume number
42
Issue number
2
First page of article
579
ISSN of journal
1095-7111
Year of publication
2013
Number of additional authors
4
Additional information

<12> This paper, in one of the top journals in theoretical computer science, presents the best-known harmonic algorithm for the 3-D strip-packing problem. A preliminary version appeared at SODA 2007, and the research has since seen application to problems including multiple strip packing (Bougeret, Grenoble), orthogonal packing for hypercubes (Harren, Saarbrucken), 3-D guillotine cutting problems (Queiroz, UNICAMP Brazil), decomposing and packing polygons (El-Khechen, Quebec) and scheduling parallel jobs (Dutot, Kiel). This research contributed to Sviridenko’s winning a Royal Society Wolfson Merit Award to study extensions of the techniques reported in this paper.

Interdisciplinary
-
Cross-referral requested
-
Research group
T - Theory and Foundations
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-