A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
type: Item
instance of: scholarly article
title: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
zbMATH Open document ID: 1003.68206
DOI: 10.1016/S0020-0190(00)00095-8
author: Ion Măndoiu
author: Alex Zelikovsky
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1771769
zbMATH Keywords: Steiner tree
zbMATH Keywords: Steiner points
MaRDI profile type: Publication
cites work: Improved Approximations for the Steiner Tree Problem
cites work: Approximations for Steiner trees with minimum number of Steiner points
cites work: A threshold of ln n for approximating set cover
cites work: Improved methods for approximating node weighted Steiner trees and connected dominating sets.
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length
cites work: Low-degree minimum spanning trees
cites work: Bottleneck Steiner trees in the plane
cites work: An 11/6-approximation algorithm for the network Steiner problem
full work available at URL: s0020-0190(00)00095-8
OpenAlex ID: W2087989351
Recommended article: Steiner tree problem with minimum number of Steiner points and bounded edge-length
Recommended article: Approximations for Steiner trees with minimum number of Steiner points
Recommended article: An improved algorithm for the Steiner tree problem with bounded edge-length
Recommended article: On better heuristics for Steiner minimum trees
Recommended article: Approximating Steiner trees and forests with minimum number of Steiner points
Recommended article: Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
Recommended article: Q4707782
Recommended article: Approximations and lower bounds for the length of minimal Euclidean Steiner trees
Recommended article: Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
description: scientific article; zbMATH DE number 1771769