We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k -1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having the same perimeter. We also co
โฆ LIBER โฆ
Covering a square by small perimeter rectangles
โ Scribed by N. Alon; D. J. Kleitman
- Publisher
- Springer
- Year
- 1986
- Tongue
- English
- Weight
- 372 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Partitioning a rectangle into small peri
โ
Noga Alon; Daniel J. Kleitman
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 593 KB
The decomposition of a square into recta
โ
T.Y Kong; David M Mount; Michael Werman
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 331 KB
On a problem about covering lines by squ
โ
Walter Kern; Alfred Wanka
๐
Article
๐
1990
๐
Springer
๐
English
โ 291 KB
Electrically small square loop antenna w
โ
Yong-Jin Kim; Hong-Min Lee
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 863 KB
## Abstract In this article, electrically small square loop antenna with a capacitive split ring resonator (SRR) cover structure is built and tested. The size of the proposed antenna (ka = 0.34) is smaller than the corresponding Chu limiting value and it is efficiently matched without additional ma
Coverings of the Vertices of a Graph by
โ
David Forge; Mekkia Kouider
๐
Article
๐
2007
๐
Springer Japan
๐
English
โ 90 KB
Covering a function on the plane by two
โ
Mariusz Rabus; Saharon Shelah
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 138 KB