π
π
The Cartographer
Lower bounds for several online variants of bin packing
August 10, 2017 Β· Declared Dead Β· π Theory of Computing Systems
"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
1708.03228
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM,
math.CO,
math.OC
Citations
16
Venue
Theory of Computing Systems
Last Checked
3 months ago
Abstract
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.
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