Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2015.02.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138026666 / rank | |||
Normal rank | |||
Revision as of 14:19, 19 March 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
