Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity (Q5753762)

From MaRDI portal
Revision as of 22:20, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4189495
Language Label Description Also known as
English
Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
scientific article; zbMATH DE number 4189495

    Statements

    Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity (English)
    0 references
    1990
    0 references
    super-modularity
    0 references
    greedy procedure
    0 references
    approximate solution
    0 references
    Steiner tree problem
    0 references
    reoptimization
    0 references
    minimum spanning tree
    0 references
    undirected graph
    0 references
    0 references

    Identifiers

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