메뉴 건너뛰기




Volumn 35, Issue 3, 2005, Pages 729-740

The rectilinear Steiner arborescence problem is NP-complete

Author keywords

Computational complexity; NP complete; Steiner tree

Indexed keywords

ARBORESCENCE PROBLEM; STEINER TREE; VLSI ROUTING;

EID: 33745439052     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704371353     Document Type: Article
Times cited : (37)

References (16)
  • 2
    • 0032156828 scopus 로고    scopus 로고
    • Polynomial time approximation scheme for Euclidean traveling salesman and other geometric problems
    • S. ARORA, Polynomial time approximation scheme for Euclidean traveling salesman and other geometric problems, J. ACM, 45 (1998), pp. 753-782.
    • (1998) J. ACM , vol.45 , pp. 753-782
    • Arora, S.1
  • 3
    • 0030674260 scopus 로고    scopus 로고
    • Min-cost flow based min-cost rectilinear Steiner distance preserving tree construction
    • ACM Press, New York
    • J. D. CHO, Min-cost flow based min-cost rectilinear Steiner distance preserving tree construction, in Proceedings of the International Symposium on Physical Design, ACM Press, New York, 1997, pp. 82-87.
    • (1997) Proceedings of the International Symposium on Physical Design , pp. 82-87
    • Cho, J.D.1
  • 4
    • 0031705566 scopus 로고    scopus 로고
    • Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design
    • J. CONG, A. B. KAHNG, AND K. S. LEUNG, Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design, IEEE Trans. Computer-Aided Design, 17 (1998), pp. 24-39.
    • (1998) IEEE Trans. Computer-aided Design , vol.17 , pp. 24-39
    • Cong, J.1    Kahng, A.B.2    Leung, K.S.3
  • 6
    • 0038764870 scopus 로고
    • A heuristic algorithm for the rectilinear steiner arborescence problem
    • Department of Computer Science, University of Florida, Gainesville, FL
    • J. CÓRDOVA AND Y. H. LEE, A Heuristic Algorithm for the Rectilinear Steiner Arborescence Problem, Technical Report TR-94-025, Department of Computer Science, University of Florida, Gainesville, FL, 1994.
    • (1994) Technical Report , vol.TR-94-025
    • Córdova, J.1    Lee, Y.H.2
  • 7
    • 33745469353 scopus 로고    scopus 로고
    • private communication
    • A. ERZIN AND A. KAHNG, private communication.
    • Erzin, A.1    Kahng, A.2
  • 11
    • 0002794707 scopus 로고
    • Planar formulae and their uses
    • D. LICHTENSTEIN, Planar formulae and their uses, SIAM J. Comput., 11 (1982), pp. 329-343.
    • (1982) SIAM J. Comput. , vol.11 , pp. 329-343
    • Lichtenstein, D.1
  • 12
    • 0038088241 scopus 로고    scopus 로고
    • Polynomial time approximation scheme for rectilinear Steiner arbores-cence problem
    • B. LU AND L. RUAN, Polynomial time approximation scheme for rectilinear Steiner arbores-cence problem, J. Comb. Optim., 4 (2000), pp. 357-363.
    • (2000) J. Comb. Optim. , vol.4 , pp. 357-363
    • Lu, B.1    Ruan, L.2
  • 14
  • 15
    • 0037750603 scopus 로고
    • Subclass of the Steiner problems on a plane with rectilinear metric
    • V. A. TRUBIN, Subclass of the Steiner problems on a plane with rectilinear metric, Cybernetics, 21 (1985), pp. 320-322.
    • (1985) Cybernetics , vol.21 , pp. 320-322
    • Trubin, V.A.1
  • 16
    • 0019532794 scopus 로고
    • Universality considerations in VLSI circuits
    • L. VALIANT, Universality considerations in VLSI circuits, IEEE Trans. Comput., 30 (1981), pp. 135-140.
    • (1981) IEEE Trans. Comput. , vol.30 , pp. 135-140
    • Valiant, L.1


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