메뉴 건너뛰기
Operations Research Letters
Volumn 19, Issue 5, 1996, Pages 217-224
Optimal and approximate bottleneck Steiner trees
Author keywords

Bottleneck Steiner trees; Facility location; Geometric algorithms; Minmax multicenter; Steiner ratio; Tree algorithms
Indexed keywords

EID: 0007012388     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(96)00028-4     Document Type: Article
Times cited : (17)
References (13)
  • 3
    • 0016057628 scopus 로고
    • A network flow solution to a multifacility location problem involving rectilinear distances
    • P.M. Dearing and R.L. Francis, "A network flow solution to a multifacility location problem involving rectilinear distances", Transport. Sci. 8, 126-141 (1974).
    • (1974) Transport. Sci. , vol.8 , pp. 126-141
    • Dearing, P.M.1    Francis, R.L.2
  • 4
    • 0022242528 scopus 로고
    • Layout of facilities with some fixed points
    • Z. Drezner and G.O. Wesolowsky, "Layout of facilities with some fixed points", Comput. Oper. Res 12, 603-610 (1985).
    • (1985) Comput. Oper. Res , vol.12 , pp. 603-610
    • Drezner, Z.1    Wesolowsky, G.O.2
  • 6
    • 0017023238 scopus 로고
    • Minimax multi-facility location with Euclidean distances
    • J. Elzinga, D. Hearn and W.D. Randolph, "Minimax multi-facility location with Euclidean distances", Transport. Sci. 10, 321-336 (1976).
    • (1976) Transport. Sci. , vol.10 , pp. 321-336
    • Elzinga, J.1    Hearn, D.2    Randolph, W.D.3
  • 7
    • 0041497423 scopus 로고
    • Ph.D. Thesis, Department of Computer Science, University of Virginia, Charlottesville, VA
    • J.L. Ganley, "Geometric interconnection and placement algorithms", Ph.D. Thesis, Department of Computer Science, University of Virginia, Charlottesville, VA, 1995.
    • (1995) Geometric Interconnection and Placement Algorithms
    • Ganley, J.L.1
  • 8
    • 0000814769 scopus 로고
    • On Steiner's problem with rectilinear distance
    • M. Hanan, "On Steiner's problem with rectilinear distance", SIAM J. Appl. Math. 14, 255-265 (1966).
    • (1966) SIAM J. Appl. Math. , vol.14 , pp. 255-265
    • Hanan, M.1
  • 9
    • 0027606736 scopus 로고
    • Utilization of vacant terminals for improved over-the-cell channel routing
    • N.D. Holmes, N.A. Sherwani and M. Sarrafzadeh, "Utilization of vacant terminals for improved over-the-cell channel routing", IEEE Trans. Comput.-Aided Des. 12, 780-792 (1993).
    • (1993) IEEE Trans. Comput.-Aided Des. , vol.12 , pp. 780-792
    • Holmes, N.D.1    Sherwani, N.A.2    Sarrafzadeh, M.3
  • 10
    • 0041468406 scopus 로고
    • A shortest path approach to a multifacility minimax location problem with rectilinear distances
    • T. Ichimori, "A shortest path approach to a multifacility minimax location problem with rectilinear distances", J. Oper. Res. Soc. Japan 28, 269-284 (1985).
    • (1985) J. Oper. Res. Soc. Japan , vol.28 , pp. 269-284
    • Ichimori, T.1
  • 11
    • 0015574415 scopus 로고
    • A multi-facility minimax location method for Euclidean distances
    • R.F. Love, G.O. Wesolowsky and S.A. Kraemer, "A multi-facility minimax location method for Euclidean distances", Internat. J. Prod. Res. 11, 37-45 (1973).
    • (1973) Internat. J. Prod. Res. , vol.11 , pp. 37-45
    • Love, R.F.1    Wesolowsky, G.O.2    Kraemer, S.A.3
  • 12
    • 0001716715 scopus 로고
    • Combinatorial optimization with rational objective functions
    • N. Megiddo, "Combinatorial optimization with rational objective functions", Math. Oper. Res. 4, 414-424 (1979).
    • (1979) Math. Oper. Res. , vol.4 , pp. 414-424
    • Megiddo, N.1
  • 13
    • 0026825918 scopus 로고
    • Bottleneck Steiner trees in the plane
    • M. Sarrafzadeh and C.K. Wong, "Bottleneck Steiner trees in the plane", IEEE Trans. Comput. 41, 370-374 (1992).
    • (1992) IEEE Trans. Comput. , vol.41 , pp. 370-374
    • Sarrafzadeh, M.1    Wong, C.K.2

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