Correct and provably efficient methods for rectilinear Steiner spanning tree generation
Two rectilinear Steiner spanning tree algorithms are presented, proven to be correct, and examined with regard to their complexity. It is shown that their worst case efficiencies are merely 1.5 times the optimum solution. These algorithms, when experimentally compared to existing algorithms, excel. They in fact produce the best solutions over 80% of the time and are never more than 1% from the best solution found.
Unable to display preview. Download preview PDF.
- BC85.Bern, M. W., and M. de Carvalho. “A Greedy Hueristic for the Rectilinear Steiner Tree Problem.” Univ. California at Berkeley TR, (1985).Google Scholar
- GaJo77.Garey, M. R., and D. S. Johnson. “The Rectilinear Steiner Tree Problem is NP-Complete.” SIAM J of Applied Mathematics, 32 (1977), 855–859.Google Scholar
- HVW89.Ho, J., G. Vijayan, and C. K. Wong. “A New Approach to the Steiner Tree Problem.” Proc. 26th ACM/IEEE Design Auto. Conf. (1989), 161–166.Google Scholar
- LiMa84.Li, J. T., and M. Marek-Sadowska. “Global Routing for Gate Arrays.” IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, CAD-3:4 (Oct 1984), 298–308.Google Scholar
- NRT86.Ng, A. P-C, P. Raghavan, and C. D. Thompson. “Experimental Results for a Linear Program Global Router.” manuscript submitted to: Computers and AI and 1986 ACM Design Automation Conference, (November 1985).Google Scholar
- Pr57.Prim, R. C. “Shortest Connection Networks and Some Generalizations.” Bell System Tech. J. 36 (1957), 1389–1401.Google Scholar
- SLL80.Smith, J. M., D. T. Lee, and J. S. Liebman. “An O(nlogn) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem.” Eng. Optimization 4 (1980), 179–192.Google Scholar
- Va87.Van Cleave, N. “Rectilinear Steiner Tree Algorithms for the Global Routing Phase of VLSI Design.” M.S. Thesis, University of Kentucky, Lexington, KY (1987).Google Scholar