Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580)
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: Complexity and approximation of the smallest \(k\)-enclosing ball problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation of the smallest \(k\)-enclosing ball problem |
scientific article |
Statements
Complexity and approximation of the smallest \(k\)-enclosing ball problem (English)
0 references
2 June 2015
0 references
2-approximation algorithm
0 references
\((2 - \varepsilon)\)-inapproximability
0 references
