On approximation algorithms for the terminal Steiner tree problem
type: Item
instance of: scholarly article
title: On approximation algorithms for the terminal Steiner tree problem
zbMATH Open document ID: 1178.68677
author: Doratha E. Drake
author: Stefan Hougardy
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5576913
zbMATH Keywords: approximation algorithms
zbMATH Keywords: Steiner tree
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.09.014
OpenAlex ID: W1980288485
cites work: Q4230322
cites work: The Steiner problem with edge lengths 1 and 2
cites work: On the Full and Bottleneck Full Steiner Tree Problems
cites work: Q3046489
cites work: A threshold of ln n for approximating set cover
cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
cites work: The Steiner tree problem
cites work: On the terminal Steiner tree problem.
cites work: Q4952699
DOI: 10.1016/J.IPL.2003.09.014
description: scientific article; zbMATH DE number 5576913