Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

46

CORR
2010
Springer

favoriteEmaildiscussreport

157views Education» more CORR 2010»

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

13 years 11 months ago

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

Download www.cs.panam.edu

The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,

Richard Beigel, Bin Fu

Real-time Traffic

Approximation Scheme | CORR 2010 | Education | Minimum Number | Uniform Random Sampling |

claim paper

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Richard Beigel, Bin Fu

Comments (0)