An edge-based heuristic for Steiner routing
Authors:
- M. BorahMBM. Borah
- R.M. OwensROR.M. Owens
- M.J. IrwinMIM.J. Irwin
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 13 (12) , 1563-1568
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994
- Rectilinear Steiner tree construction by local and global refinementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Performance oriented rectilinear Steiner trees1993
- A new class of iterative Steiner tree heuristics with good performanceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Global routing based on Steiner min-max treesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- New algorithms for the rectilinear Steiner tree problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning TreesJournal of the ACM, 1979
- An O(n log n) algorithm for suboptimal rectilinear Steiner treesIEEE Transactions on Circuits and Systems, 1979
- Use of Steiner's problem in suboptimal routing in rectilinear metricIEEE Transactions on Circuits and Systems, 1976
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976