Article
Licensed
Unlicensed
Requires Authentication
On-line algorithms for packing rectangles into several strips
-
S. N. Zhuk
Published/Copyright:
December 10, 2007
The problem of packing rectangles into several strips is considered. It is shown that for this problem there exist on-line algorithms with multiplicative error asymptotically close to 2e, where e is the base of the natural logarithm. It is proved that none of the on-line algorithms can have the asymptotic multiplicative error less than e.
Received: 2007-January-16
Published Online: 2007-12-10
Published in Print: 2007-12-11
© de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The limit distribution of the size of a giant component in an Internet-type random graph
- On conditions for emergence of a giant tree in a random unlabelled forest
- On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
- A multiple optimal stopping rule for sums of independent random variables
- The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
- On the structure of the set of reversible cellular automata
- On-line algorithms for packing rectangles into several strips
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
Articles in the same Issue
- The limit distribution of the size of a giant component in an Internet-type random graph
- On conditions for emergence of a giant tree in a random unlabelled forest
- On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
- A multiple optimal stopping rule for sums of independent random variables
- The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
- On the structure of the set of reversible cellular automata
- On-line algorithms for packing rectangles into several strips
- An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
