An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382)
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: An Approximation Algorithm for the Smallest Color-Spanning Circle Problem |
scientific article; zbMATH DE number 6501915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Approximation Algorithm for the Smallest Color-Spanning Circle Problem |
scientific article; zbMATH DE number 6501915 |
Statements
An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (English)
0 references
29 October 2015
0 references
computational geometry
0 references
colored set
0 references
approximation algorithm
0 references
minimum diameter color-spanning set problem
0 references
0.9366691
0 references
0.92934954
0 references
0.8970207
0 references
0.8925395
0 references
0.8890007
0 references
0.88607943
0 references
0.88426614
0 references
0 references
