Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:14, 5 February 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
