A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843)

From MaRDI portal
Revision as of 14:28, 21 June 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 cost allocation rule for \(k\)-hop minimum cost spanning tree problems
scientific article

    Statements

    A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2012
    0 references

    Identifiers