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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0601043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963869288 / rank | |||
Normal rank | |||
Revision as of 21:55, 19 March 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
