An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.SoCG.2018.72 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.SOCG.2018.72 / rank | |||
Normal rank | |||
Latest revision as of 15:59, 30 December 2024
scientific article; zbMATH DE number 7236476
| 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 7236476 |
Statements
18 August 2020
0 references
\(k\)-center
0 references
trees
0 references
facility locations
0 references
0 references
An O(n log n)-Time Algorithm for the k-Center Problem in Trees (English)
0 references
