Heuristics for the Steiner problem in graphs (Q1199447)

From MaRDI portal
Revision as of 16:16, 16 May 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
Heuristics for the Steiner problem in graphs
scientific article

    Statements

    title
    Heuristics for the Steiner problem in graphs (English)
    0 references
    author
    Ján Plesník
    0 references
    publication date
    16 January 1993
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C05
    0 references
    zbMATH DE Number
    94326
    0 references
    zbMATH Keywords
    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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1199447&oldid=34096243"
    Powered by MediaWiki