An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree (Q3960131): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:57, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree |
scientific article |
Statements
An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree (English)
0 references
1980
0 references
locating p facilities on a tree network
0 references
center location
0 references
