Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
type: Item
instance of: scholarly article
title: Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
zbMATH Open document ID: 0916.90259
DOI: 10.1016/S0166-218X(98)00089-4
author: Joseph L. Ganley
published in: Discrete Applied Mathematics
publication date: 1999-07-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1247550
zbMATH Keywords: rectilinear Steiner tree problem
zbMATH Keywords: minimum-length rectilinear interconnection
MaRDI profile type: Publication
cites work: An SST-based algorithm for the steiner problem in graphs
cites work: On the Average Number of Maxima in a Set of Vectors and Applications
cites work: Faster exact algorithms for steiner trees in planar networks
cites work: A probably fast, provably optimal algorithm for rectilinear Steiner trees
cites work: The steiner problem in graphs
cites work: Improved Computation of Optimal Rectilinear Steiner Minimal Trees
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Steiner's problem in graphs and its implications
cites work: On Steiner’s Problem with Rectilinear Distance
cites work: On Steiner Minimal Trees with Rectilinear Distance
cites work: The Steiner tree problem
cites work: Probabilistic partitioning algorithms for the rectilinear steiner problem
cites work: Convexity and the Steiner tree problem
cites work: Thirty‐five‐point rectilinear steiner minimal trees in a day
cites work: An algorithm for the steiner problem in graphs
cites work: Q3970808
cites work: Q4763327
cites work: Q4395337
cites work: Reductions for the rectilinear steiner tree problem
description: scientific article; zbMATH DE number 1247550