Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
type: Item
instance of: scholarly article
title: Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
zbMATH Open document ID: 1408.90297
author: Annika Kristina Kiefner
published in: Operations Research Letters
publication date: 2019-01-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7002361
zbMATH Keywords: Steiner trees with given topology
zbMATH Keywords: rectilinear Steiner tree problem
zbMATH Keywords: VLSI design
zbMATH Keywords: signal delays
MaRDI profile type: Publication
full work available at URL: j.orl.2016.10.010
OpenAlex ID: W2544484530
cites work: Rectilinear steiner trees: Efficient special-case algorithms
cites work: Q4363167
cites work: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Shallow-Light Steiner Arborescences with Vertex Delays
cites work: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
cites work: On Steiner Minimal Trees with Rectilinear Distance
cites work: Delay-related secondary objectives for rectilinear Steiner minimum trees.
cites work: Balancing minimum spanning trees and shortest-path trees
cites work: The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
cites work: Locating the vertices of a steiner tree in an arbitrary metric space
cites work: Thirty‐five‐point rectilinear steiner minimal trees in a day
cites work: Steiner Trees with Bounded RC-Delay
cites work: How to find Steiner minimal trees in Euclidean \(d\)-space
cites work: Q4395337
DOI: 10.1016/J.ORL.2016.10.010
description: scientific article; zbMATH DE number 7002361