Inverse minimum cost flow problems under the weighted Hamming distance (Q992575)

From MaRDI portal
Revision as of 00:57, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Inverse minimum cost flow problems under the weighted Hamming distance
scientific article

    Statements

    Inverse minimum cost flow problems under the weighted Hamming distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    network flows
    0 references
    inverse problem
    0 references
    Hamming distance
    0 references
    APX-hard
    0 references
    strongly polynomial algorithm
    0 references
    0 references