On greedy heuristic for Steiner minimum trees
type: Item
instance of: scholarly article
title: On greedy heuristic for Steiner minimum trees
zbMATH Open document ID: 0827.68086
DOI: 10.1007/BF01293486
author: Du Ding-Zhu
published in: Algorithmica
publication date: 1995-05-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 759301
zbMATH Keywords: Steiner minimum tree
zbMATH Keywords: greedy tree
MaRDI profile type: Publication
cites work: Improved Approximations for the Steiner Tree Problem
cites work: Q3689203
cites work: A Lower Bound for the Steiner Tree Problem
cites work: A New Bound for the Steiner Ratio
cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: Steiner Minimal Trees
cites work: Q4100104
cites work: Some remarks on the Steiner problem
cites work: The Steiner ratio conjecture for six points
cites work: A variational approach to the Steiner network problem
cites work: Steiner tree problems
cites work: Q3663561
cites work: An 11/6-approximation algorithm for the network Steiner problem
full work available at URL: https://doi.org/10.1007/bf01293486
OpenAlex ID: W2022498554
description: scientific article; zbMATH DE number 759301