A fast and simple Steiner routing heuristic

DOI10.1016/S0166-218X(98)00085-7zbMath0913.68102MaRDI QIDQ1276958

Manjit Borah, Mary Jane Irwin, Robert Michael Owens

Publication date: 13 June 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Steiner routing

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Unnamed Item
• Applications of Path Compression on Balanced Trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Use of Steiner's problem in suboptimal routing in rectilinear metric
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Steiner tree problems

This page was built for publication: A fast and simple Steiner routing heuristic