A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:55, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple greedy approximation algorithm for the minimum connected \(k\)-center problem |
scientific article |
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
