An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee (Q4706223): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Stephan J. Eidenbenz / rank | |||
| Property / author | |||
| Property / author: Peter Widmayer / rank | |||
| Property / author | |||
| Property / author: Stephan J. Eidenbenz / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Peter Widmayer / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:01, 5 March 2024
scientific article; zbMATH DE number 1931303
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee |
scientific article; zbMATH DE number 1931303 |
Statements
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee (English)
0 references
19 June 2003
0 references
convex cover
0 references
art gallery
0 references
inapproximability
0 references
approximation algorithms
0 references
dynamic programming
0 references
