Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles (Q3826568)
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 4101203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles |
scientific article; zbMATH DE number 4101203 |
Statements
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles (English)
0 references
1989
0 references
covering
0 references
rectilinear polygon
0 references
orthogonal polygon
0 references
approximation algorithm
0 references
0.8818637132644653
0 references
0.874727189540863
0 references
0.8661960959434509
0 references
0.8661960959434509
0 references
0.8642820119857788
0 references
