Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology

DOI10.1016/j.orl.2016.10.010zbMath1408.90297OpenAlexW2544484530MaRDI QIDQ1709982

Annika Kristina Kiefner

Publication date: 15 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.10.010

zbMATH Keywords

VLSI designSteiner trees with given topologyrectilinear Steiner tree problemsignal delays

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• How to find Steiner minimal trees in Euclidean \(d\)-space
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• Balancing minimum spanning trees and shortest-path trees
• On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
• The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
• Steiner Trees with Bounded RC-Delay
• Locating the vertices of a steiner tree in an arbitrary metric space
• On Steiner Minimal Trees with Rectilinear Distance
• Rectilinear steiner trees: Efficient special-case algorithms
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Thirty‐five‐point rectilinear steiner minimal trees in a day
• Shallow-Light Steiner Arborescences with Vertex Delays

This page was built for publication: Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology