Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291): 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.1145/1082036.1082038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966395945 / rank | |||
Normal rank | |||
Latest revision as of 02:47, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate |
scientific article |
Statements
Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (English)
0 references
21 December 2008
0 references
approximation algorithms
0 references
asymmetric \(k\)-center
0 references
hardness of approximation
0 references
metric \(k\)-center
0 references
