On the sum-of-squares algorithm for bin packing

Authors:
Janos Csirik;David S. Johnson;Claire Kenyon;James B. Orlin;Peter W. Shor;Richard R. Weber
Affiliations:
Department of Computer Sciences, University of Szeged, Szeged, Hungary;AT&T Labs, Room C239, 180, Park Avenue, Florham Park, NJ;Laboratoire de Recherche en Informatique, Bâtiment 490, Université Paris-Sud, 91405 Orsay Cedex, France;Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA;AT&T Labs, Room C237, 180, Park Avenue, Florham Park, NJ;Statistical Laboratory, University of Cambridge, Cambridge CB2 1SB, England
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Better approximation algorithms for bin covering

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deep performance analysis of refined harmonic bin packing algorithm

Journal of Computer Science and Technology
Sum-of-squares heuristics for bin packing and memory allocation

Journal of Experimental Algorithmics (JEA)
A sublinear-time approximation scheme for bin packing

Theoretical Computer Science
Bounded-space online bin cover

Journal of Scheduling
O((log n)2) time online approximation schemes for bin packing and subset sum problems

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
A dense hierarchy of sublinear time approximation schemes for bin packing

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Hi-index	0.00