On the sum-of-squares algorithm for bin packing
From MaRDI portal
Publication:3191987
DOI10.1145/335305.335331zbMath1296.68076OpenAlexW2080241423MaRDI QIDQ3191987
James B. Orlin, Claire M. Kenyon, Richard R. Weber, David S. Johnson, János A. Csirik, Peter W. Shor
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335331
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Deep performance analysis of refined harmonic bin packing algorithm, Online stochastic optimization under time constraints, Average case analysis of bounded space bin packing algorithms, Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing, A sublinear-time approximation scheme for bin packing, Probabilistic analysis of shelf algorithms for strip packing, Bounded-space online bin cover
