Covering a point set by two disjoint rectangles (Q3089094)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Covering a point set by two disjoint rectangles |
scientific article; zbMATH DE number 5942019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering a point set by two disjoint rectangles |
scientific article; zbMATH DE number 5942019 |
Statements
COVERING A POINT SET BY TWO DISJOINT RECTANGLES (English)
0 references
23 August 2011
0 references
two-box covering
0 references
disjoint rectangles
0 references
bipartition
0 references
geometric optimization
0 references
0.9510855674743652
0 references
0.8655478358268738
0 references
0.8344641923904419
0 references
0.8223624229431152
0 references
0.8089949488639832
0 references
