Covering simply connected regions by rectangles (Q1063613): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Ervin Gyoeri / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ralph G.Stanton / rank | |||
| Property / author | |||
| Property / author: Ervin Gyoeri / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ralph G.Stanton / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering Regions by Rectangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimax theorem on intervals / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:00, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering simply connected regions by rectangles |
scientific article |
Statements
Covering simply connected regions by rectangles (English)
0 references
1985
0 references
The authors prove that the ratio of the minimum number of rectangles covering a simply connected board (polyomino) B and the maximum number of points in B no two of which are contained in a common rectangle is less than 2.
0 references
covering by rectagles
0 references
polyomino
0 references
