Worst-case performance of some heuristics for Steiner's problem in directed graphs
type: Item
instance of: scholarly article
title: Worst-case performance of some heuristics for Steiner's problem in directed graphs
zbMATH Open document ID: 0788.68111
DOI: 10.1016/0020-0190(93)90185-C
author: Stefan Voß
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 500556
zbMATH Keywords: Steiner tree
zbMATH Keywords: Steiner's problem
zbMATH Keywords: directed graphs
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: worst-case performance
MaRDI profile type: Publication
cites work: Une heuristique pour le problème de l'arbre de Steiner
cites work: Reducing the hierarchical network design problem
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: Steiner tree problems
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: Q3988522
cites work: Q3874241
cites work: Q3998318
cites work: Steiner's problem in graphs: Heuristic methods
cites work: Worst-case performance of Rayward-Smith's Steiner tree heuristic
cites work: Steiner problem in networks: A survey
cites work: A dual ascent approach for steiner tree problems on a directed graph
full work available at URL: 0020-0190(93)90185-c
OpenAlex ID: W1970669216
description: scientific article; zbMATH DE number 500556