151 search results - page 7 / 31 » Online Square Packing |
WAOA
2004
Springer
15 years 2 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
AOR
2006
14 years 9 months 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...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
TCS
2008
14 years 9 months ago
2008
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
COLT
2008
Springer
14 years 11 months ago
2008
Springer