Global routing based on Steiner min-max trees

This publication has 21 references indexed in Scilit:

• A new global router for row-based layout
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• New global routing subsystem for CMOS gate arrays
  IEE Proceedings - Circuits, Devices and Systems, 1994
• An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
• Global wire routing in two-dimensional arrays
  Algorithmica, 1987
• A Hierarchical Global Wiring Algorithm for Custom Chip Design
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
• An iterative-improvement penalty-function-driven wire routing system
  IBM Journal of Research and Development, 1984
• Planar Formulae and Their Uses
  SIAM Journal on Computing, 1982
• Use of Steiner's problem in suboptimal routing in rectilinear metric
  IEEE Transactions on Circuits and Systems, 1976
• On Steiner Minimal Trees with Rectilinear Distance
  SIAM Journal on Applied Mathematics, 1976
• An Algorithm for Path Connections and Its Applications
  IEEE Transactions on Electronic Computers, 1961