Path-distance heuristic for the Steiner problem in undirected networks (Q1186805): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01758765 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063395464 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Path-distance heuristic for the Steiner problem in undirected networks
scientific article

    Statements

    Path-distance heuristic for the Steiner problem in undirected networks (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    The authors give a common characterization of three heuristics for the Steiner minimum tree problem: shortest path heuristic, distance network heuristic and average distance heuristic. The foregoing single path heuristics and some variations are extended using repetitive application of the shortest path heuristic. Also a computational analysis of several single path heuristics is given.
    0 references
    path-distance heuristic
    0 references
    Steiner problem
    0 references
    shortest distance
    0 references

    Identifiers