A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9831-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9831-8 / rank | |||
Normal rank | |||
Latest revision as of 13:16, 9 December 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
