A linear-time heuristic for minimum rectangular coverings (Extended abstract) (Q5055944)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7631381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time heuristic for minimum rectangular coverings (Extended abstract) |
scientific article; zbMATH DE number 7631381 |
Statements
A linear-time heuristic for minimum rectangular coverings (Extended abstract) (English)
0 references
9 December 2022
0 references
0 references
0 references
0.9003818035125732
0 references
0.8818637132644653
0 references
0.8798961043357849
0 references
0.8781898021697998
0 references
