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

From MaRDI portal
Revision as of 21:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    locating p facilities on a tree network
    0 references
    center location
    0 references
    0 references