An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648)
From MaRDI portal
scientific article; zbMATH DE number 7333147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees |
scientific article; zbMATH DE number 7333147 |
Statements
An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (English)
0 references
14 April 2021
0 references
\(k\)-center
0 references
trees
0 references
algorithms
0 references
computational geometry
0 references
facility locations
0 references
0 references
