A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828)

From MaRDI portal
Revision as of 07:45, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
scientific article

    Statements

    A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (English)
    0 references
    9 April 2015
    0 references
    location
    0 references
    dynamic programming
    0 references
    \(p\)-median problem
    0 references

    Identifiers