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

From MaRDI portal
Revision as of 23:16, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    Identifiers