English

A lower bound for online rectangle packing

Data Structures and Algorithms 2018-11-26 v1 Discrete Mathematics Combinatorics Optimization and Control
Authors: Leah Epstein
View on arXiv ↗ PDF ↗

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

bin packing

Cite

@article{arxiv.1811.09573,
  title  = {A lower bound for online rectangle packing},
  author = {Leah Epstein},
  journal= {arXiv preprint arXiv:1811.09573},
  year   = {2018}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Lower bounds for several online variants of bin packing
János Balogh, József Békési, György Dósa, Leah Epstein +1
2017-08-11
Data Structures and Algorithms · Computer Science
A new lower bound for classic online bin packing
János Balogh, József Békési, György Dósa, Leah Epstein +1
2018-07-17
Data Structures and Algorithms · Computer Science
Truly asymptotic lower bounds for online vector bin packing
Janos Balogh, Leah Epstein, Asaf Levin
2020-08-04
Data Structures and Algorithms · Computer Science
A New Upper Bound on 2D Online Bin Packing
Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang
2009-06-03
Data Structures and Algorithms · Computer Science
Online bin packing of squares and cubes
Leah Epstein, Loay Mualem
2021-05-20
Computational Geometry · Computer Science
Online Packing to Minimize Area or Perimeter
Mikkel Abrahamsen, Lorenzo Beretta
2021-01-27
Data Structures and Algorithms · Computer Science
Improved online hypercube packing
Xin Han, Deshi Ye, Yong Zhou
2016-08-31
Data Structures and Algorithms · Computer Science
Beating the Harmonic lower bound for online bin packing
Sandy Heydrich, Rob van Stee
2018-06-29
Data Structures and Algorithms · Computer Science
More on ordered open end bin packing
János Balogh, Leah Epstein, Asaf Levin
2020-10-15
Data Structures and Algorithms · Computer Science
Strip Packing vs. Bin Packing
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
2007-05-23
Data Structures and Algorithms · Computer Science
Online bin packing with cardinality constraints resolved
János Balogh, József Békési, György Dósa, Leah Epstein +1
2016-08-24
Data Structures and Algorithms · Computer Science
Online Bin Packing with Advice
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2013-12-24
Data Structures and Algorithms · Computer Science
Online Circle and Sphere Packing
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier
2017-08-30
Computer Science and Game Theory · Computer Science
Online bin stretching lower bounds: Improved search of computational proofs
Antoine Lhomme, Olivier Romane, Nicolas Catusse, Nadia Brauner
2022-12-19
Data Structures and Algorithms · Computer Science
Online bin packing with cardinality constraints revisited
Gyorgy Dosa, Leah Epstein
2014-04-04
Data Structures and Algorithms · Computer Science
An Asymptotic Lower Bound for Online Vector Bin Packing
Nikhil Bansal, Ilan Reuven Cohen
2020-08-06
Data Structures and Algorithms · Computer Science
A new and improved algorithm for online bin packing
János Balogh, József Békési, György Dósa, Leah Epstein +1
2017-07-07
Data Structures and Algorithms · Computer Science
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem
Martin Böhm, Bertrand Simon
2022-10-17
Data Structures and Algorithms · Computer Science
Improved Lower Bounds for Online Hypercube and Rectangle Packing
David Blitz, Sandy Heydrich, Rob van Stee, André van Vliet +1
2017-11-07
Data Structures and Algorithms · Computer Science
Tight Bounds for Restricted Grid Scheduling
Joan Boyar, Faith Ellen
2018-06-05
Data Structures and Algorithms · Computer Science
Optimal Competitive Ratio of Two-sided Online Bipartite Matching
Zhihao Gavin Tang
2026-02-23
Data Structures and Algorithms · Computer Science
Online Bin Stretching with Three Bins
Martin Böhm, Jiří Sgall, Rob van Stee, Pavel Veselý
2016-02-02
Computational Geometry · Computer Science
Online Packing of Orthogonal Polygons
Tim Gerlach, Benjamin Hennies, Linda Kleist
2026-03-24
Combinatorics · Mathematics
A tight lower bound for the online bounded space hypercube bin packing problem
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
2023-06-22
Data Structures and Algorithms · Computer Science
Improving Online Bin Covering with Little Advice
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujović
2025-06-11
R2 v1 2026-06-23T05:25:45.692Z