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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Time bounds for selection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the connectivity of maximal planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Selecting the <i>K</i>th Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $ / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank | |||
Normal rank | |||
Latest revision as of 17:08, 13 June 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
