Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity (Q5753762): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:14, 5 March 2024

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