Sciweavers

RANDOM   1998 International Workshop on Randomization and Approximation Techniques in Computer Science
Wall of Fame | Most Viewed RANDOM-1998 Paper
RANDOM
1998
Springer
13 years 7 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source135
2Download preprint from source105
3Download preprint from source100
4Download preprint from source98
5Download preprint from source94
6Download preprint from source89
7Download preprint from source86
8Download preprint from source84
9Download preprint from source82