메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 90, Issue 1-3, 1999, Pages 51-67
A fast and simple Steiner routing heuristic
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0001885235     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00085-7     Document Type: Article
Times cited : (17)
References (15)
  • 1
    • 0028552975 scopus 로고
    • Rectilinear steiner trees with minimum Elmore delay
    • K.D. Boese, A.B. Kahng, B. McKoy, G. Robins, Rectilinear Steiner trees with minimum Elmore delay, Proc. DAC (1994) 381-386.
    • (1994) Proc. DAC , pp. 381-386
    • Boese, K.D.1    Kahng, A.B.2    McKoy, B.3    Robins, G.4
  • 2
    • 0027226891 scopus 로고
    • High-performance routing trees with identified critical sinks
    • K.D. Boese, A.B. Kahng, G. Robins, High-performance routing trees with identified critical sinks, Proc. DAC (1993) 182-187.
    • (1993) Proc. DAC , pp. 182-187
    • Boese, K.D.1    Kahng, A.B.2    Robins, G.3
  • 3
    • 0028733612 scopus 로고
    • An edge-based heuristic for steiner routing
    • M. Borah, R.M. Owens, M.J. Irwin, An edge-based heuristic for Steiner routing, IEEE Trans. CAD 13 (12) (1994) 1563-1568.
    • (1994) IEEE Trans. CAD , vol.13 , Issue.12 , pp. 1563-1568
    • Borah, M.1    Owens, R.M.2    Irwin, M.J.3
  • 4
    • 0025540320 scopus 로고
    • Rectilinear steiner tree construction by local and global refinement
    • T.H. Chao, Y.C. Hsu, Rectilinear Steiner tree construction by local and global refinement, Proc. ICCAD 9 (1990) 432-435.
    • (1990) Proc. ICCAD , vol.9 , pp. 432-435
    • Chao, T.H.1    Hsu, Y.C.2
  • 5
    • 0000727336 scopus 로고
    • The rectilinear Steiner problem is NP-complete
    • M. Garey, D.S. Johnson. The rectilinear Steiner problem is NP-complete, SIAM J. Appl. Math. 32 (4) (1977) 826-834.
    • (1977) SIAM J. Appl. Math. , vol.32 , Issue.4 , pp. 826-834
    • Garey, M.1    Johnson, D.S.2
  • 6
    • 0028532894 scopus 로고
    • Closing the gap: Near-optimal Steiner trees in polynomial time
    • J. Griffith, G. Robins, J.S. Salowe, T. Zhang, Closing the gap: near-optimal Steiner trees in polynomial time, IEEE Trans. CAD 13 (11) (1994) 1351-1365.
    • (1994) IEEE Trans. CAD , vol.13 , Issue.11 , pp. 1351-1365
    • Griffith, J.1    Robins, G.2    Salowe, J.S.3    Zhang, T.4
  • 7
    • 0016983068 scopus 로고
    • Use of Steiner's problem in sub-optimal routing in rectilinear metric
    • J.H. Lee, N.K. Bose, F.K. Hwang, Use of Steiner's problem in sub-optimal routing in rectilinear metric, IEEE Trans. Circuits Systems (1976) 470-476.
    • (1976) IEEE Trans. Circuits Systems , pp. 470-476
    • Lee, J.H.1    Bose, N.K.2    Hwang, F.K.3
  • 8
    • 0021426157 scopus 로고
    • Fast algorithms for finding nearest common ancestors
    • D. Harel, R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (2) (1984) 338-355.
    • (1984) SIAM J. Comput. , vol.13 , Issue.2 , pp. 338-355
    • Harel, D.1    Tarjan, R.E.2
  • 9
    • 0025384580 scopus 로고
    • New algorithms for the rectilinear Steiner tree problem
    • J.M. Ho, G. Vijayan, C.K. Wong, New algorithms for the rectilinear Steiner tree problem, IEEE Trans. CAD 9 (2) (1990) 185-193.
    • (1990) IEEE Trans. CAD , vol.9 , Issue.2 , pp. 185-193
    • Ho, J.M.1    Vijayan, G.2    Wong, C.K.3
  • 10
    • 0018455887 scopus 로고
    • An O(n log n) algorithm for rectilinear minimal spanning trees
    • F.K. Hvvang, An O(n log n) Algorithm for rectilinear minimal spanning trees, J. Assoc. Comput. Mach. 26 (2) (1979) 177-182.
    • (1979) J. Assoc. Comput. Mach. , vol.26 , Issue.2 , pp. 177-182
    • Hvvang, F.K.1
  • 11
    • 0025545054 scopus 로고
    • A new class of Steiner tree heuristics with good performance: The iterated 1-steiner approach
    • A.B. Kahng, G. Robins, A new class of Steiner tree heuristics with good performance: the iterated 1-steiner approach, Proc. ICCAD 9 (1990) 428-431.
    • (1990) Proc. ICCAD , vol.9 , pp. 428-431
    • Kahng, A.B.1    Robins, G.2
  • 14
    • 0018533367 scopus 로고
    • Applications of path compression on balanced trees
    • R.E. Tarjan, Applications of path compression on balanced trees, J. Assoc. Comput. Mach. 26 (4) (1979) 690-705.
    • (1979) J. Assoc. Comput. Mach. , vol.26 , Issue.4 , pp. 690-705
    • Tarjan, R.E.1
  • 15
    • 0004090058 scopus 로고
    • Ch. 9, Computer Science Press, Inc., Rockville, MD
    • J.D. Ullman, Computational Aspects of VLSL Ch. 9, Computer Science Press, Inc., Rockville, MD, 1984.
    • (1984) Computational Aspects of VLSL
    • Ullman, J.D.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.