Steiner's problem in double trees
type: Item
instance of: scholarly article
title: Steiner's problem in double trees
zbMATH Open document ID: 1009.05040
DOI: 10.1016/S0893-9659(02)00053-8
author: W. Fitch
author: Dietmar Cieslik
author: Andreas W. M. Dress
published in: Applied Mathematics Letters
publication date: 2003-03-10T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1878892
zbMATH Keywords: Steiner's problem
zbMATH Keywords: Steiner minimal trees
zbMATH Keywords: SMT
zbMATH Keywords: double trees optimization
zbMATH Keywords: discrete optimization
zbMATH Keywords: dynamic programming
zbMATH Keywords: most parsimonious trees
MaRDI profile type: Publication
cites work: Steiner's problem in graphs and its implications
cites work: Q4142699
cites work: Q4130999
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: Steiner problem in networks: A survey
cites work: Generalized steiner problem in series-parallel networks
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
cites work: Steiner minimal trees
cites work: Advances in Steiner trees
cites work: The Steiner tree problem
cites work: Q3998318
cites work: Rectilinear steiner trees: Efficient special-case algorithms
cites work: A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
cites work: Thirty‐five‐point rectilinear steiner minimal trees in a day
cites work: On Steiner’s Problem with Rectilinear Distance
cites work: Q3812222
cites work: Q4734768
cites work: Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
cites work: The steiner problem in graphs
full work available at URL: s0893-9659(02)00053-8
OpenAlex ID: W2054725215
description: scientific article; zbMATH DE number 1878892