An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
An O(n log n)-Time Algorithm for the k-Center Problem in Trees | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2018.72 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962711322 / rank | |||
Normal rank | |||
| Property / title | |||
An O(n log n)-Time Algorithm for the k-Center Problem in Trees (English) | |||
| Property / title: An O(n log n)-Time Algorithm for the k-Center Problem in Trees (English) / rank | |||
Normal rank | |||
Revision as of 10:05, 30 July 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
