A lower bound for the steiner tree problem in directed graphs (Q5753759)

From MaRDI portal
Revision as of 15:14, 2 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4189493
Language Label Description Also known as
English
A lower bound for the steiner tree problem in directed graphs
scientific article; zbMATH DE number 4189493

    Statements

    A lower bound for the steiner tree problem in directed graphs (English)
    0 references
    0 references
    0 references
    1990
    0 references
    minimum Steiner tree problem
    0 references
    directed graphs
    0 references
    dual ascent algorithm
    0 references
    projection method
    0 references
    lower bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references