A better constant-factor approximation for selected-internal Steiner minimum tree
type: Item
instance of: scholarly article
title: A better constant-factor approximation for selected-internal Steiner minimum tree
zbMATH Open document ID: 1187.68713
author: Xianyue Li
author: Feng Zou
author: Yaochun Huang
author: Donghyun Kim
author: Weili Wu
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5674326
zbMATH Keywords: selected-internal Steiner tree
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s00453-009-9301-8
OpenAlex ID: W2143095751
cites work: Thek-Steiner Ratio in Graphs
cites work: Q5692514
cites work: On approximation algorithms for the terminal Steiner tree problem
cites work: On component-size bounded Steiner trees
cites work: The Steiner problem in phylogeny is NP-complete
cites work: A note on the terminal Steiner tree problem
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: Approximating the selected-internal Steiner tree
cites work: The Steiner tree problem
cites work: Q4764186
cites work: Q3210200
cites work: On the terminal Steiner tree problem.
cites work: The full Steiner tree problem
cites work: Algorithms for terminal Steiner trees
cites work: Q4952699
DOI: 10.1007/S00453-009-9301-8
description: scientific article; zbMATH DE number 5674326