Heuristics for the Steiner problem in graphs (Q1199447): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two probabilistic results on rectilinear Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing to Multiple Destinations in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une heuristique pour le problème de l'arbre de Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network decomposition for the optimization of connection structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding steiner vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case performance of Rayward-Smith's Steiner tree heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank

Latest revision as of 16:16, 16 May 2024

scientific article
Language Label Description Also known as
English
Heuristics for the Steiner problem in graphs
scientific article

    Statements

    Heuristics for the Steiner problem in graphs (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree heuristic
    0 references
    contraction heuristic
    0 references
    average distance heuristic
    0 references
    path heuristic
    0 references
    Steiner problem in graphs
    0 references
    minimum cost tree
    0 references
    worst-case performance
    0 references