Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059)

From MaRDI portal
Revision as of 11:18, 30 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 minimum flow problem under the weighted sum-type Hamming distance
scientific article

    Statements

    Inverse minimum flow problem under the weighted sum-type Hamming distance (English)
    0 references
    0 references
    27 July 2017
    0 references
    minimum flow
    0 references
    minimum cut
    0 references
    inverse problem
    0 references
    Hamming distance
    0 references
    strongly polynomial algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references