The paper considers packing of rectangles into an infinite bin. Similar to the Tetris game, the rectangles arrive from the top and, once placed, cannot be moved again. The rectangles are moved inside the bin to reach their place. For the case in which rotations are allowed, we design an algorithm wh
โฆ LIBER โฆ
Further reflections on the one-dimensional packing problem
โ Scribed by Richard W. Freedman; Fred Gornick
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 665 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On Two Dimensional Packing
โ
Yossi Azar; Leah Epstein
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 247 KB
On the tree packing problem
โ
Shigeru Masuyama
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 338 KB
On the vertex packing problem
โ
C. De Simone
๐
Article
๐
1993
๐
Springer Japan
๐
English
โ 546 KB
Further Reflections on Thompson's Conjec
โ
Guiyun Chen
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 85 KB
## ลฝ . ร < Let G be a finite group and let N G s n g N G has a conjugacy class C, We have proved previously that: If M is a sporadic simple group or a simple group having its prime graph with at least three prime graph components, then Thompson's conjecture is correct. In this paper, we shall pro
A further note on a two-dimensional free
โ
R. P. Gilbert; H. Kendall
๐
Article
๐
1961
๐
Springer
๐
English
โ 90 KB
Invited editorial comment: Further refle
โ
John M. Opitz; Theodore J. Pysher
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 173 KB
๐ 1 views