An integrated approach to routing and via minimization

DOI10.1016/0020-0190(91)90025-DzbMath0751.68076OpenAlexW2016149888MaRDI QIDQ1183405

John D. Provence, D. Sreenivasa Rao

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90025-d

zbMATH Keywords

VLSI routingrectilinear Steiner treesvia minimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Circuits, networks (94C99) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Steiner problem in networks: A survey
• On Steiner Minimal Trees with Rectilinear Distance
• Use of Steiner's problem in suboptimal routing in rectilinear metric
• An O(n log n) algorithm for suboptimal rectilinear Steiner trees
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• On Steiner’s Problem with Rectilinear Distance

This page was built for publication: An integrated approach to routing and via minimization