A primal-dual approximation algorithm for the Steiner forest problem
type: Item
instance of: scholarly article
title: A primal-dual approximation algorithm for the Steiner forest problem
zbMATH Open document ID: 0807.68058
DOI: 10.1016/0020-0190(94)00034-4
author: R. Ravi
published in: Information Processing Letters
publication date: 1994-06-15T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 590254
zbMATH Keywords: minimum \(q\)-Steiner forest problem
zbMATH Keywords: undirected graph
zbMATH Keywords: primal-dual approximation algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00034-4
OpenAlex ID: W2109719517
cites work: Q4763418
cites work: The steiner problem in graphs
cites work: Some generalizations of the steiner problem in graphs
cites work: Une heuristique pour le problème de l'arbre de Steiner
cites work: Steiner's problem in graphs and its implications
cites work: Steiner tree problems
cites work: Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
cites work: Q4142699
cites work: A fast algorithm for Steiner trees
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
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
description: scientific article; zbMATH DE number 590254