Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129)

From MaRDI portal
Revision as of 12:44, 7 July 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
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
scientific article

    Statements

    Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (English)
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    min-max spanning tree
    0 references
    inverse problem
    0 references
    Hamming distance
    0 references
    strongly polynomial algorithms
    0 references