An SST-based algorithm for the steiner problem in graphs (Q3813625)

From MaRDI portal
Revision as of 10:39, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An SST-based algorithm for the steiner problem in graphs
scientific article

    Statements

    An SST-based algorithm for the steiner problem in graphs (English)
    0 references
    0 references
    1989
    0 references
    Steiner problem
    0 references
    undirected graph
    0 references
    shortest spanning tree
    0 references
    additional constraints
    0 references
    lower bound
    0 references
    Lagrangean relaxation
    0 references
    0 references

    Identifiers