We introduce an almost-online algorithm for the square packing problem which achieves a competitive ratio of at most 1.84. The algorithm receives advice of size.

In the square packing problem, the goal is to pack squares of dierent sizes into the smallest number of bins (squares) of uniform size.

The almost square rectangle packing problem involves packing all rectangles with sizes 1 ×2 to n ×(n + 1) (almost squares) into an enclosing rectangle of ...

Aug 27, 2022 · The goal is to pack all square bins into a minimum number of squares of unit size. The asymptotic competitive ratio is the standard method for ...

We introduce an almostonline square packing algorithm which places squares in an online, sequential manner. In doing so, it receives advice of logarithmic size ...

Feb 8, 2022 · This paper concerns a variant of an old problem of Meir and Moser, who asks whether it is possible to perfectly pack squares of sidelength {1/n} for {n \geq 2} ...

Online Square-into-Square Packing · S. Fekete, Hella-Franziska Hoffmann · Published in Algorithmica 22 March 2014 · Computer Science, Mathematics.

3.1 Robustness of Almost-Online-Square-Packing . ... Almost online square packing. In. Proceedings of the 26th Canadian Conference ...

Missing: Online | Show results with:Online

Missing: Almost | Show results with:Almost