On the Sum-of-Squares algorithm for bin packing
From MaRDI portal
Publication:3546292
DOI10.1145/1120582.1120583zbMath1326.68334arXivcs/0210013OpenAlexW1992365301WikidataQ56813486 ScholiaQ56813486MaRDI QIDQ3546292
James B. Orlin, David S. Johnson, Claire M. Kenyon, Richard R. Weber, Peter W. Shor, János A. Csirik
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0210013
Analysis of algorithms (68W40) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Approximation and online algorithms for multidimensional bin packing: a survey, Exact and approximate methods for a one-dimensional minimax bin-packing problem, A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap, Interior-Point-Based Online Stochastic Bin Packing, Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints, Large-scale heterogeneous service systems with general packing constraints, Adaptive Bin Packing with Overflow
