Heuristics for the Steiner problem in graphs
type: Item
instance of: scholarly article
title: Heuristics for the Steiner problem in graphs
zbMATH Open document ID: 0768.68171
DOI: 10.1016/0166-218X(92)90151-Y
author: Ján Plesník
published in: Discrete Applied Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 94326
zbMATH Keywords: spanning tree heuristic
zbMATH Keywords: contraction heuristic
zbMATH Keywords: average distance heuristic
zbMATH Keywords: path heuristic
zbMATH Keywords: Steiner problem in graphs
zbMATH Keywords: minimum cost tree
zbMATH Keywords: worst-case performance
MaRDI profile type: Publication
cites work: Two probabilistic results on rectilinear Steiner trees
cites work: Routing to Multiple Destinations in Computer Networks
cites work: Une heuristique pour le problème de l'arbre de Steiner
cites work: The steiner problem in graphs
cites work: Steiner Minimal Trees
cites work: Steiner tree problems
cites work: Dynamic Steiner Tree Problem
cites work: Network decomposition for the optimization of connection structures
cites work: Q3797192
cites work: A fast algorithm for Steiner trees
cites work: A faster approximation algorithm for the Steiner problem in graphs
cites work: Q3907583
cites work: The computation of nearly minimal Steiner trees in graphs
cites work: On finding steiner vertices
cites work: Q3874241
cites work: Worst-case performance of Rayward-Smith's Steiner tree heuristic
cites work: Q3785980
cites work: Steiner problem in networks: A survey
cites work: An 11/6-approximation algorithm for the network Steiner problem
description: scientific article; zbMATH DE number 94326