메뉴 건너뛰기




Volumn 28, Issue 4, 1996, Pages 187-193

An approximation scheme for some Steiner tree problems in the plane

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0038971681     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199612)28:4<187::AID-NET3>3.0.CO;2-H     Document Type: Article
Times cited : (14)

References (18)
  • 2
    • 0023825797 scopus 로고
    • Two probabilistic results on rectilinear Steiner trees
    • M. W. Bern, Two probabilistic results on rectilinear Steiner trees. Algorithmica 3 (1988) 191-204.
    • (1988) Algorithmica , vol.3 , pp. 191-204
    • Bern, M.W.1
  • 3
    • 0003252136 scopus 로고
    • Random graphs and electric networks
    • The Mathematical Association of America
    • P. Doyle and J. L. Snell, Random Graphs and Electric Networks. The Carus Mathematical Monographs, The Mathematical Association of America (1984).
    • (1984) The Carus Mathematical Monographs
    • Doyle, P.1    Snell, J.L.2
  • 4
    • 0025889227 scopus 로고
    • An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio
    • D. Z. Du and F. K. Hwang, An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio. Proceedings of the 31st IEEE Foundation of Computer Science (1990) 76-85.
    • (1990) Proceedings of the 31st Ieee Foundation of Computer Science , pp. 76-85
    • Du, D.Z.1    Hwang, F.K.2
  • 6
    • 0000287785 scopus 로고
    • The complexity of computing Steiner minimal trees
    • M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32 (1977) 835-859.
    • (1977) SIAM J. Appl. Math. , vol.32 , pp. 835-859
    • Garey, M.R.1    Graham, R.L.2    Johnson, D.S.3
  • 7
    • 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. 32 (1977) 826-834.
    • (1977) SIAM J. Appl. Math. , vol.32 , pp. 826-834
    • Garey, M.R.1    Johnson, D.S.2
  • 10
    • 0021897852 scopus 로고
    • Approximation schemes for covering and packing problems in image processing and VLSI
    • D. S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32 (1985) 130-136.
    • (1985) J. ACM , vol.32 , pp. 130-136
    • Hochbaum, D.S.1    Maass, W.2
  • 12
    • 0016891335 scopus 로고
    • On Steiner minimal trees with rectilinear distance
    • F. K. Hwang, On Steiner minimal trees with rectilinear distance. SIAM. J. Appl. Math. 30 (1976) 104-114.
    • (1976) SIAM. J. Appl. Math. , vol.30 , pp. 104-114
    • Hwang, F.K.1
  • 13
    • 84863090748 scopus 로고
    • Steiner tree problems
    • F. K. Hwang and D. S. Richards, Steiner tree problems. Networks 22 (1992) 55-89.
    • (1992) Networks , vol.22 , pp. 55-89
    • Hwang, F.K.1    Richards, D.S.2
  • 14
    • 0025536092 scopus 로고
    • Comments on Bern's probabilistic results on rectilinear Steiner trees
    • F. K. Hwang and Y. C. Yao, Comments on Bern's probabilistic results on rectilinear Steiner trees. Algorithmica 5 (1990) 591-598.
    • (1990) Algorithmica , vol.5 , pp. 591-598
    • Hwang, F.K.1    Yao, Y.C.2
  • 16
    • 0017523323 scopus 로고
    • Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane
    • R. M. Karp, Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. Oper. Res. 2 (1977) 209-224.
    • (1977) Math. Oper. Res. , vol.2 , pp. 209-224
    • Karp, R.M.1
  • 17
    • 0022361810 scopus 로고
    • Probabilistic partitioning algorithms for the rectilinear Steiner problem
    • J. Komlos and M. T. Shing, Probabilistic partitioning algorithms for the rectilinear Steiner problem. Networks 15 (1985) 413-423.
    • (1985) Networks , vol.15 , pp. 413-423
    • Komlos, J.1    Shing, M.T.2
  • 18
    • 0000334511 scopus 로고
    • Automatic domain partitioning in three dimensions
    • S. A. Vavasis, Automatic domain partitioning in three dimensions. SIAM J. Sci. Stat. Comput. 12-4 (1991) 950-970.
    • (1991) SIAM J. Sci. Stat. Comput. , vol.12 , Issue.4 , pp. 950-970
    • Vavasis, S.A.1


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