A lower bound for online rectangle packing

Leah Epstein

doi:https://doi.org/10.1007/s10878-019-00423-z

A lower bound for online rectangle packing

Leah Epstein

Department of Mathematics

University of Haifa

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

Abstract

We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.

Original language	American English
Pages (from-to)	846-866
Number of pages	21
Journal	Journal of Combinatorial Optimization
Volume	38
Issue number	3
DOIs	https://doi.org/10.1007/s10878-019-00423-z
State	Published - 15 Oct 2019

Keywords

Competitive ratio
Online algorithms
Rectangle packing

All Science Journal Classification (ASJC) codes

Computer Science Applications
Discrete Mathematics and Combinatorics
Control and Optimization
Computational Theory and Mathematics
Applied Mathematics

Access to Document

https://doi.org/10.1007/s10878-019-00423-z

Cite this

@article{6410dec0a52349dcbf476e39494ea0f1,

title = "A lower bound for online rectangle packing",

abstract = "We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.",

keywords = "Competitive ratio, Online algorithms, Rectangle packing",

author = "Leah Epstein",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2019",

month = oct,

day = "15",

doi = "https://doi.org/10.1007/s10878-019-00423-z",

language = "American English",

volume = "38",

pages = "846--866",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - A lower bound for online rectangle packing

AU - Epstein, Leah

PY - 2019/10/15

Y1 - 2019/10/15

N2 - We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.

AB - We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.

KW - Competitive ratio

KW - Online algorithms

KW - Rectangle packing

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

U2 - https://doi.org/10.1007/s10878-019-00423-z

DO - https://doi.org/10.1007/s10878-019-00423-z

M3 - Article

SN - 1382-6905

VL - 38

SP - 846

EP - 866

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 3

ER -

A lower bound for online rectangle packing

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this