AOR 2006
 |  |
Wall of Fame | Most Viewed AOR-2006 Paper
AOR
2006
14 years 24 days ago
2006
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 99 | ||
| 2 | | 95 | ||
| 3 | | 85 | ||
| 4 | | 77 | ||
| 5 | | 74 |