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

From MaRDI portal
Revision as of 01:35, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    \(k\)-hop minimum cost spanning tree problems
    0 references
    bankruptcy problems
    0 references
    constrained equal awards rule
    0 references

    Identifiers