Bounds for online bounded space hypercube packing

Leah Epstein; Rob van Stee

doi:10.1016/j.disopt.2006.11.005

Bounds for online bounded space hypercube packing

Leah Epstein, Rob van Stee

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2, ..., 7.

Original language	English
Pages (from-to)	185-197
Number of pages	13
Journal	Discrete Optimization
Volume	4
Issue number	2
DOIs	https://doi.org/10.1016/j.disopt.2006.11.005
State	Published - 1 Jun 2007

Bibliographical note

Funding Information:
The second author’s research was supported by the Alexander von Humboldt-Stiftung.

Keywords

Bin packing
Bounded space
Online algorithms

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/j.disopt.2006.11.005

Cite this

@article{4ea0041de6d9435ba28cc4d5887eee8c,

title = "Bounds for online bounded space hypercube packing",

abstract = "In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2, ..., 7.",

keywords = "Bin packing, Bounded space, Online algorithms",

author = "Leah Epstein and {van Stee}, Rob",

note = "Funding Information: The second author{\textquoteright}s research was supported by the Alexander von Humboldt-Stiftung.",

year = "2007",

month = jun,

day = "1",

doi = "10.1016/j.disopt.2006.11.005",

language = "English",

volume = "4",

pages = "185--197",

journal = "Discrete Optimization",

issn = "1572-5286",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Bounds for online bounded space hypercube packing

AU - Epstein, Leah

AU - van Stee, Rob

N1 - Funding Information: The second author’s research was supported by the Alexander von Humboldt-Stiftung.

PY - 2007/6/1

Y1 - 2007/6/1

N2 - In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2, ..., 7.

AB - In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2, ..., 7.

KW - Bin packing

KW - Bounded space

KW - Online algorithms

UR - http://www.scopus.com/inward/record.url?scp=34047274632&partnerID=8YFLogxK

U2 - 10.1016/j.disopt.2006.11.005

DO - 10.1016/j.disopt.2006.11.005

M3 - Article

AN - SCOPUS:34047274632

SN - 1572-5286

VL - 4

SP - 185

EP - 197

JO - Discrete Optimization

JF - Discrete Optimization

IS - 2

ER -

Bounds for online bounded space hypercube packing

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this