Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291)
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: Asymmetric k -center is log * n -hard to approximate |
scientific article; zbMATH DE number 5426538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate |
scientific article; zbMATH DE number 5426538 |
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
0.995320200920105
0 references
0.8581916093826294
0 references
0.8514397144317627
0 references
0.8506600260734558
0 references
