{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T23:34:54Z","timestamp":1772580894359,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0020-0190(97)00224-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"131-134","source":"Crossref","is-referenced-by-count":41,"title":["The p-neighbor k-center problem"],"prefix":"10.1016","volume":"65","author":[{"given":"Shiva","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naveen","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00224-X_BIB1","series-title":"Proc. ACM Symp. on Theory of Computing","first-page":"434","article-title":"Optimal algorithms for approximate clusters","author":"Feder","year":"1988"},{"key":"10.1016\/S0020-0190(97)00224-X_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonz\u00e1lez","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00224-X_BIB3","series-title":"Location on Networks: Theory and Algorithms","author":"Handler","year":"1979"},{"key":"10.1016\/S0020-0190(97)00224-X_BIB4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","article-title":"A best possible heuristic for the k-center problem","volume":"10","author":"Hochbaum","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(97)00224-X_BIB5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for bottleneck problems","volume":"33","author":"Hochbaum","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00224-X_BIB6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems. Part I: The p-centers problem","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0020-0190(97)00224-X_BIB7","series-title":"Proc. 3rd Italian Conf. on Algorithms and Complexity","article-title":"Fault-tolerant K-center problems","author":"Khuller","year":"1997"},{"key":"10.1016\/S0020-0190(97)00224-X_BIB8","unstructured":"Also appears as Tech. Rept. UMIACS-TR-96-40."},{"key":"10.1016\/S0020-0190(97)00224-X_BIB9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","article-title":"On a generalization of the p-center problem","volume":"56","author":"Krumke","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00224-X_BIB10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","article-title":"A heuristic for the p-center problem in graphs","volume":"17","author":"Plesnik","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00224-X_BIB11","series-title":"Proc. WADS'91","first-page":"355","article-title":"Facility dispersion problems: Heuristics and special cases","volume":"vol. 519","author":"Ravi","year":"1991"},{"key":"10.1016\/S0020-0190(97)00224-X_BIB12","series-title":"Proc. SIGAL'90","first-page":"388","article-title":"A heuristic algorithm for in: the k-center problem with vertex weight","volume":"vol. 450","author":"Wang","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700224X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700224X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:53:46Z","timestamp":1555944826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909700224X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S002001909700224X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00224-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}