ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Approximation algorithms for extensible bin packing

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: E. G. Coffman, Jr. Columbia University
George S. Lueker University of California, Irvine
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2001
table of contents ISBN:0-89871-490-7
Approximation algorithms for extensible bin packing 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 32
· Citation Count: 6


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 © 2012 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