An algorithm for finding a \(k\)-median in a directed tree (Q1607050): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00026-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973158291 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for finding a \(k\)-median in a directed tree
scientific article

    Statements

    An algorithm for finding a \(k\)-median in a directed tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    \(k\)-median
    0 references

    Identifiers