A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-015-9831-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028082337 / rank | |||
Normal rank | |||
Revision as of 02:27, 20 March 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
