An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees (Q5116532)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n n)-time algorithm for the k-center problem in trees |
scientific article; zbMATH DE number 7236476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9998500347137452
0 references
0.8639786839485168
0 references
0.8287729024887085
0 references
0.8199195265769958
0 references
0.81988126039505
0 references
