Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:16, 2 February 2024
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
