메뉴 건너뛰기




Volumn 18, Issue 2, 1997, Pages 125-134

A near-linear algorithm for the planar 2-center problem

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031491470     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009311     Document Type: Article
Times cited : (81)

References (17)
  • 1
    • 0028375715 scopus 로고
    • Planar geometric location problems
    • P. Agarwal and M. Sharir, Planar geometric location problems, Algorithmica 11 (1994), 185-195.
    • (1994) Algorithmica , vol.11 , pp. 185-195
    • Agarwal, P.1    Sharir, M.2
  • 3
    • 0023271105 scopus 로고
    • Slowing down sorting networks to obtain faster sorting algorithms
    • R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. Assoc. Comput. Mech. 34 (1987), 200-208.
    • (1987) J. Assoc. Comput. Mech. , vol.34 , pp. 200-208
    • Cole, R.1
  • 4
    • 0021532114 scopus 로고
    • The planar two-center and two-median problems
    • Z. Drezner, The planar two-center and two-median problems, Transportation Sci. 18 (1984), 351-361.
    • (1984) Transportation Sci. , vol.18 , pp. 351-361
    • Drezner, Z.1
  • 6
    • 0027912875 scopus 로고
    • A faster algorithm for the two-center decision problem
    • J. Hershberger, A faster algorithm for the two-center decision problem, Inform. Process. Lett. 47 (1993), 23-29.
    • (1993) Inform. Process. Lett. , vol.47 , pp. 23-29
    • Hershberger, J.1
  • 7
    • 0001032454 scopus 로고
    • Finding tailored partitions
    • J. Hershberger and S. Suri, Finding tailored partitions, J. Algorithms 12 (1991), 431-463.
    • (1991) J. Algorithms , vol.12 , pp. 431-463
    • Hershberger, J.1    Suri, S.2
  • 9
    • 0027147716 scopus 로고
    • The slab dividing approach to solve the euclidean P-center problem
    • R. Z. Hwang, R. C. T. Lee, and R. C. Chang, The slab dividing approach to solve the euclidean P-center problem, Algorithmica 9 (1993), 1-22.
    • (1993) Algorithmica , vol.9 , pp. 1-22
    • Hwang, R.Z.1    Lee, R.C.T.2    Chang, R.C.3
  • 12
    • 0026205620 scopus 로고
    • Randomized optimal algorithm for slope selection
    • J. Matoušek, Randomized optimal algorithm for slope selection, Inform. Process. Lett. 39 (1991), 183-187.
    • (1991) Inform. Process. Lett. , vol.39 , pp. 183-187
    • Matoušek, J.1
  • 13
    • 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. Assoc. Comput. Mach. 30 (1983), 852-865.
    • (1983) J. Assoc. Comput. Mach. , vol.30 , pp. 852-865
    • Megiddo, N.1
  • 14
    • 0000423548 scopus 로고
    • 3 and related problems
    • 3 and related problems, SIAM J. Comput. 12 (1983), 759-776.
    • (1983) SIAM J. Comput. , vol.12 , pp. 759-776
    • Megiddo, N.1
  • 15
    • 0021373110 scopus 로고
    • On the complexity of some common geometric location problems
    • N. Megiddo and K. Supowit, On the complexity of some common geometric location problems, SIAM J. Comput. 13 (1984), 1182-1196.
    • (1984) SIAM J. Comput. , vol.13 , pp. 1182-1196
    • Megiddo, N.1    Supowit, K.2
  • 16
    • 0019625505 scopus 로고
    • Maintenance of configurations in the plane
    • M. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23 (1981), 166-204.
    • (1981) J. Comput. System Sci. , vol.23 , pp. 166-204
    • Overmars, M.1    Van Leeuwen, J.2


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