메뉴 건너뛰기




Volumn 21, Issue 11, 2002, Pages 1368-1372

Preferred direction steiner trees

Author keywords

Interconnect synthesis; Optimization; Routing; Steiner tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; GEOMETRY; HEURISTIC METHODS; OPTIMIZATION; TREES (MATHEMATICS); VLSI CIRCUITS;

EID: 0036864705     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2002.804105     Document Type: Article
Times cited : (10)

References (14)
  • 2
    • 0000727336 scopus 로고
    • The rectilinear steiner tree problem is NP-complete
    • M. R. Garey and D. S. Johnson, "The rectilinear steiner tree problem is NP-complete," SIAM J. Appl. Math, vol. 32, pp. 826-834, 1977.
    • (1977) SIAM J. Appl. Math , vol.32 , pp. 826-834
    • Garey, M.R.1    Johnson, D.S.2
  • 3
    • 0000814769 scopus 로고
    • Steiner's problem with rectilinear distance
    • M. Hanan, "Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, pp. 255-265, 1966.
    • (1966) SIAM J. Appl. Math. , vol.14 , pp. 255-265
    • Hanan, M.1
  • 4
    • 0025384580 scopus 로고
    • New algorithms for the rectilinear steiner tree problem
    • Feb
    • J. M. Ho, G. Vijayan, and C. K. Wong, "New algorithms for the rectilinear Steiner tree problem," IEEE Trans. Computer-Aided Design, vol. 9, pp. 185-193, Feb. 1990.
    • (1990) IEEE Trans. Computer-Aided Design , vol.9 , pp. 185-193
    • Ho, J.M.1    Vijayan, G.2    Wong, C.K.3
  • 5
    • 0016891335 scopus 로고
    • On steiner minimal trees with rectilinear distance
    • Jan
    • F. K. Hwang, "On Steiner minimal trees with rectilinear distance," SIAM J. Appl. Math., vol. 30, no. 1, pp. 104-114, Jan. 1976.
    • (1976) SIAM J. Appl. Math. , vol.30 , Issue.1 , pp. 104-114
    • Hwang, F.K.1
  • 6
    • 84863090748 scopus 로고
    • Steiner tree problems
    • Jan
    • F. K. Hwang and D. S. Richards, "Steiner tree problems," Networks, vol. 22, no. 1, pp. 55-89 Jan. 1992.
    • (1992) Networks , vol.22 , Issue.1 , pp. 55-89
    • Hwang, F.K.1    Richards, D.S.2
  • 7
    • 0026898405 scopus 로고
    • A new class of iterative steiner tree heuristics with good performance
    • July
    • A. B. Kahng and G. Robins, "A new class of iterative Steiner tree heuristics with good performance," IEEE Trans. Computer-Aided Design, vol. 11, pp. 893-902, July 1992.
    • (1992) IEEE Trans. Computer-Aided Design , vol.11 , pp. 893-902
    • Kahng, A.B.1    Robins, G.2
  • 9
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph
    • J. B. Kruskal, "On the shortest spanning subtree of a graph," in Proc. Amer. Math. Soc., vol. 7, 1956, pp. 48-50.
    • (1956) Proc. Amer. Math. Soc. , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 11
    • 0012022513 scopus 로고
    • Shortest connecting networks
    • R. C. Prim, "Shortest connecting networks," Bell System Tech. J., vol. 31, pp. 1398-1401, 1957.
    • (1957) Bell System Tech. J. , vol.31 , pp. 1398-1401
    • Prim, R.C.1
  • 12
    • 84871431980 scopus 로고    scopus 로고
    • The geosteiner 3.0 package
    • [Online]
    • D. M. Warme, P. Winter, and M. Zacharisen. The geosteiner 3.0 package. [Online]. Available: ftp.diku.dk/diku/users/marginez/geosteiner-3.0.tar.gz.
    • Warme, D.M.1    Winter, P.2    Zacharisen, M.3
  • 14


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