LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (Q4650093): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some NP-hard polygon decomposition problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering Polygons Is Hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect Graphs and Orthogonally Convex Covers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering orthogonal polygons with star polygons: The perfect graph approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On covering orthogonal polygons with star-shaped polygons / rank | |||
Normal rank | |||
Revision as of 21:43, 5 July 2024
scientific article; zbMATH DE number 6110167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM |
scientific article; zbMATH DE number 6110167 |
Statements
LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (English)
0 references
23 November 2012
0 references
approximation algorithms
0 references
\(r\)-star cover
0 references
orthogonal polygon
0 references
