Information Bounds Are Weak in the Shortest Distance Problem (Q3930655)

From MaRDI portal
Revision as of 20:03, 20 October 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
Information Bounds Are Weak in the Shortest Distance Problem
scientific article

    Statements

    Information Bounds Are Weak in the Shortest Distance Problem (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    realizable patterns
    0 references
    decision tree model
    0 references
    Farkas lemma
    0 references
    lower bound
    0 references
    maximum flow
    0 references
    polyhedron
    0 references
    shortest path
    0 references

    Identifiers