π
π
The Cartographer
A new lower bound for classic online bin packing
July 15, 2018 Β· Declared Dead Β· π Algorithmica
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
JΓ‘nos Balogh, JΓ³zsef BΓ©kΓ©si, GyΓΆrgy DΓ³sa, Leah Epstein, Asaf Levin
arXiv ID
1807.05554
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM,
math.CO,
math.OC
Citations
46
Venue
Algorithmica
Last Checked
3 months ago
Abstract
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted