메뉴 건너뛰기




Volumn 65, Issue 3, 1998, Pages 131-134

The p-neighbor k-center problem

Author keywords

Approximation algorithms; Centers; Design of algorithms; Facility location

Indexed keywords


EID: 0041494542     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00224-x     Document Type: Article
Times cited : (51)

References (11)
  • 2
    • 0021938963 scopus 로고
    • Clustering to minimize the maximum intercluster distance
    • T.F. González, Clustering to minimize the maximum intercluster distance, Theoret. Comput. Sci. 38 (1985) 293-306.
    • (1985) Theoret. Comput. Sci. , vol.38 , pp. 293-306
    • González, T.F.1
  • 4
    • 0022064511 scopus 로고
    • A best possible heuristic for the k-center problem
    • D.S. Hochbaum, D.B. Shmoys, A best possible heuristic for the k-center problem. Math. Oper. Res. 10 (1985) 180-184.
    • (1985) Math. Oper. Res. , vol.10 , pp. 180-184
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 5
    • 0022753024 scopus 로고
    • A unified approach to approximation algorithms for bottleneck problems
    • D.S. Hochbaum, D.B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, J. ACM 33 (1986) 533-550.
    • (1986) J. ACM , vol.33 , pp. 533-550
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 6
    • 0018683792 scopus 로고
    • An algorithmic approach to network location problems. Part I: The p-centers problem
    • O. Kariv, S.L. Hakimi, An algorithmic approach to network location problems. Part I: The p-centers problem, SIAM J. Appl. Math. 37 (1979) 513-538.
    • (1979) SIAM J. Appl. Math. , vol.37 , pp. 513-538
    • Kariv, O.1    Hakimi, S.L.2
  • 8
    • 0042653424 scopus 로고
    • On a generalization of the p-center problem
    • S.O. Krumke, On a generalization of the p-center problem, Inform. Process. Lett. 56 (1995) 67-71.
    • (1995) Inform. Process. Lett. , vol.56 , pp. 67-71
    • Krumke, S.O.1
  • 9
    • 0009000195 scopus 로고
    • A heuristic for the p-center problem in graphs
    • J. Plesnik, A heuristic for the p-center problem in graphs, Discrete Appl. Math. 17 (1987) 263-268.
    • (1987) Discrete Appl. Math. , vol.17 , pp. 263-268
    • Plesnik, J.1
  • 10
    • 85029416420 scopus 로고
    • Facility dispersion problems: Heuristics and special cases
    • Lecture Notes in Computer Science, Springer, Berlin
    • S.S. Ravi, D.J. Rosenkrantz, G.K. Tayi, Facility dispersion problems: Heuristics and special cases, in: Proc. WADS'91, Lecture Notes in Computer Science, vol. 519, Springer, Berlin, 1991, pp. 355-366.
    • (1991) Proc. WADS'91 , vol.519 , pp. 355-366
    • Ravi, S.S.1    Rosenkrantz, D.J.2    Tayi, G.K.3
  • 11
    • 85031792709 scopus 로고
    • A heuristic algorithm for in: The k-center problem with vertex weight
    • Lecture Notes in Computer Science, Springer, Berlin
    • Q. Wang, K.H. Cheng, A heuristic algorithm for in: the k-center problem with vertex weight, in: Proc. SIGAL'90, Lecture Notes in Computer Science, vol. 450, Springer, Berlin, 1990, pp. 388-396.
    • (1990) Proc. SIGAL'90 , vol.450 , pp. 388-396
    • Wang, Q.1    Cheng, K.H.2


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