A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773)
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: A simple greedy approximation algorithm for the minimum connected k-center problem |
scientific article; zbMATH DE number 6579235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple greedy approximation algorithm for the minimum connected \(k\)-center problem |
scientific article; zbMATH DE number 6579235 |
Statements
A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (English)
0 references
11 May 2016
0 references
\(k\)-center
0 references
greedy algorithm
0 references
approximation algorithm
0 references
0.7768868803977966
0 references
0.7707079648971558
0 references
0.7692683935165405
0 references
0.766133189201355
0 references
