Sum-of-squares heuristics for bin packing and memory allocation

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Michael A. Bender Stony Brook University, New York
Bryan Bradley Hofstra University, Hempstead, New York
Geetha Jagannathan Stevens Institute of Technology, Hoboken, New Jersey
Krishnan Pillaipakkamnatt Hofstra University, Hempstead, New York
Sum-of-squares heuristics for bin packing and memory allocation Published by ACM 2008 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 47
· Downloads (cumulative): 779
· Citation Count: 0

Published in:
· Journal
Journal of Experimental Algorithmics (JEA) JEA Homepage archive
Volume 12, June 2008
Article No. 2.3
ACM New York, NY, USA
table of contents doi>10.1145/1227161.1227165

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder