On the sum-of-squares algorithm for bin packing

doi:10.1145/335305.335331

On the sum-of-squares algorithm for bin packing

Full Text:

PDF

Buy this Article

Authors:	Janos Csirik	Department of Computer Sciences, University of Szeged, Szeged, Hungary
	David S. Johnson	AT&T Labs, Room C239, 180, Park Avenue, Florham Park, NJ
	Claire Kenyon	Laboratoire de Recherche en Informatique, Bâtiment 490, Université Paris-Sud, 91405 Orsay Cedex, France
	James B. Orlin	Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA
	Peter W. Shor	AT&T Labs, Room C237, 180, Park Avenue, Florham Park, NJ
	Richard R. Weber	Statistical Laboratory, University of Cambridge, Cambridge CB2 1SB, England

	2000 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 15 · Downloads (cumulative): 483 · Citation Count: 6

Published in:

	· Proceeding
	STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
	Pages 208-217 ACM New York, NY, USA ©2000 table of contents ISBN:1-58113-184-4 doi>10.1145/335305.335331

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- STOC'13

Tags: algorithms design linear programming performance routing and layout theory verification

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player