An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p -Center Problem on a Tree

This paper considers the problem of locating $p$ facilities on a tree network in order to minimize the maximum of the distances of the points on the network to their respective nearest facilities. An $O ( ( n\log p )^2 )$ algorithm for a tree network with $n$ nodes is presented.

Saved in:
Bibliographic Details
Published inSIAM journal on algebraic and discrete methods Vol. 1; no. 4; pp. 370 - 375
Main Authors Chandrasekaran, R., Tamir, A.
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.12.1980
Subjects
Algorithms
Neighborhoods
Online AccessGet full text
ISSN0196-5212
0895-4798
2168-345X
1095-7162
DOI10.1137/0601043

Cover

More Information
Summary:This paper considers the problem of locating $p$ facilities on a tree network in order to minimize the maximum of the distances of the points on the network to their respective nearest facilities. An $O ( ( n\log p )^2 )$ algorithm for a tree network with $n$ nodes is presented.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0196-5212
0895-4798
2168-345X
1095-7162
DOI:10.1137/0601043