메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 1533 LNCS, Issue , 1998, Pages 29-40
Computing weighted rectilinear median and center set in the presence of obstacles
Author keywords

[No Author keywords available]
Indexed keywords

EID: 84867470942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_5     Document Type: Conference Paper
Times cited : (11)
References (10)
  • 1
    • 0024681436 scopus 로고
    • Cascading divide-and-conquer: A technique for designing parallel algorithms
    • M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms, SIAM J. Comput., 18:499-532, 1989.
    • (1989) SIAM J. Comput. , vol.18 , pp. 499-532
    • Atallah, M.J.1    Cole, R.2    Goodrich, M.T.3
  • 2
    • 0028384164 scopus 로고
    • Computing a median point of a simple rectilinear polygon
    • V. Chepoi and F. Dragan, Computing a median point of a simple rectilinear polygon, Inform. Process. Lett., 49:281-285, 1994.
    • (1994) Inform. Process. Lett. , vol.49 , pp. 281-285
    • Chepoi, V.1    Dragan, F.2
  • 3
    • 0022769162 scopus 로고
    • On a multidimensional search technique and its application to the euclidean one-centre problem
    • M. E. Dyer, On a multidimensional search technique and its application to the Euclidean one-centre problem, SIAM J. Comput., 15:725-738, 1986.
    • (1986) SIAM J. Comput. , vol.15 , pp. 725-738
    • Dyer, M.E.1
  • 4
    • 0002792353 scopus 로고
    • Rectilinear shortest paths in the presence of rectilinear barriers
    • P. J. de Rezende, D. T. Lee, and Y. F. Wu, Rectilinear shortest paths in the presence of rectilinear barriers, Discrete Comput. Geom., 4:41-53, 1989.
    • (1989) Discrete Comput. Geom. , vol.4 , pp. 41-53
    • De Rezende, P.J.1    Lee, D.T.2    Wu, Y.F.3
  • 6
    • 0025925572 scopus 로고
    • On weighted rectilinear 2-center and 3-center problems
    • M. T. Ko and R. C. T. Lee, On weighted rectilinear 2-center and 3-center problems, Inform. Sci., 54:169-190, 1991.
    • (1991) Inform. Sci. , vol.54 , pp. 169-190
    • Ko, M.T.1    Lee, R.C.T.2
  • 8
    • 0020787302 scopus 로고
    • Facility locations with the manhattan metric in the presence of barriers to travel
    • R. C. Larson and G. Sadiq, Facility locations with the Manhattan metric in the presence of barriers to travel, Oper. Res., 31:652-669, 1983.
    • (1983) Oper. Res. , vol.31 , pp. 652-669
    • Larson, R.C.1    Sadiq, G.2
  • 9
    • 0020828745 scopus 로고
    • Applying parallel computation algorithms in the design of serial algorithms
    • N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30:852-865, 1983.
    • (1983) J. ACM , vol.30 , pp. 852-865
    • Megiddo, N.1
  • 10
    • 0029702232 scopus 로고    scopus 로고
    • Rectilinear and polygonal p-piercing and p-center problems
    • M. Sharir and E. Welzl, Rectilinear and polygonal p-piercing and p-center problems, Proc. 12th ACM Symp. Comput. Geom., 122-132, 1996.
    • (1996) Proc. 12th ACM Symp. Comput. Geom. , pp. 122-132
    • Sharir, M.1    Welzl, E.2

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