A faster approximation algorithm for the Steiner tree problem in graphs
type: Item
instance of: scholarly article
title: A faster approximation algorithm for the Steiner tree problem in graphs
zbMATH Open document ID: 0770.68078
DOI: 10.1016/0020-0190(93)90201-J
author: Alex Zelikovsky
published in: Information Processing Letters
publication date: 1993-08-08T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 218916
zbMATH Keywords: combinatorial problems
zbMATH Keywords: approximation algorithms
zbMATH Keywords: Steiner tree
MaRDI profile type: Publication
cites work: Q4763418
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Q4142699
cites work: A faster approximation algorithm for the Steiner problem in graphs
cites work: Q3874241
cites work: Q3983367
cites work: Q4027204
full work available at URL: 0020-0190(93)90201-j
OpenAlex ID: W2032228390
description: scientific article; zbMATH DE number 218916