{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T11:48:40Z","timestamp":1751456920177,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["279558"],"award-info":[{"award-number":["279558"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00453-018-0425-6","type":"journal-article","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T13:47:54Z","timestamp":1521553674000},"page":"3889-3907","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast Approximation Algorithms for p-Centers in Large $$\\delta $$ \u03b4 -Hyperbolic Graphs"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7931-7312","authenticated-orcid":false,"given":"Katherine","family":"Edwards","sequence":"first","affiliation":[]},{"given":"W. Sean","family":"Kennedy","sequence":"additional","affiliation":[]},{"given":"Iraj","family":"Saniee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"key":"425_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12494-9","volume-title":"Metric Spaces of Non-Positive Curvature","author":"MR Bridson","year":"1999","unstructured":"Bridson, M.R., Haefliger, A.: Metric Spaces of Non-Positive Curvature, vol. 319. Springer, Berlin (1999)"},{"issue":"1","key":"425_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.6.1.50","volume":"6","author":"R Chandrasekaran","year":"1981","unstructured":"Chandrasekaran, R., Daughety, A.: Location on tree networks: p-centre and n-dispersion problems. Math. Oper. Res. 6(1), 50\u201357 (1981)","journal-title":"Math. Oper. Res."},{"key":"425_CR3","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. In: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, pp. 59\u201368. ACM (2008)","DOI":"10.1145\/1377676.1377687"},{"key":"425_CR4","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Estellon, B.: Packing and covering $\\delta $-hyperbolic spaces by balls. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 59\u201373. Springer (2007)","DOI":"10.1007\/978-3-540-74208-1_5"},{"issue":"6","key":"425_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"ME Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: A simple heuristic for the p-centre problem. Oper. Res. Lett. 3(6), 285\u2013288 (1985)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"425_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut, E.: The discrete p-dispersion problem. Eur. J. Oper. Res. 46(1), 48\u201360 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"425_CR7","first-page":"68","volume":"29","author":"E Erkut","year":"1991","unstructured":"Erkut, E., Neuman, S.: Comparison of four models for dispersing facilities. INFOR 29, 68\u201386 (1991)","journal-title":"INFOR"},{"issue":"10","key":"425_CR8","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1016\/0305-0548(94)90041-8","volume":"21","author":"E Erkut","year":"1994","unstructured":"Erkut, E., \u00dclk\u00fcsal, Y., Yenicerioglu, O.: A comparison of p-dispersion heuristics. Comput. Oper. Res. 21(10), 1103\u20131113 (1994)","journal-title":"Comput. Oper. Res."},{"key":"425_CR9","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Algorithms and Data Structures, pp. 299\u2013319. Springer (1991)","DOI":"10.1007\/BFb0028271"},{"key":"425_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9586-7_3","volume-title":"Hyperbolic Groups","author":"M Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic Groups. Springer, Berlin (1987)"},{"issue":"2","key":"425_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"425_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W-L Hsu","year":"1979","unstructured":"Hsu, W.-L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discrete Appl. Math. 1(3), 209\u2013215 (1979)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"425_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM (JACM) 24(1), 1\u201313 (1977)","journal-title":"J. ACM (JACM)"},{"key":"425_CR14","doi-asserted-by":"crossref","unstructured":"Kennedy, W.S., Saniee, I., Narayan, O.: On the hyperbolicity of large-scale networks and its estimation. In: 2016 IEEE International Conference on Big Data (Big Data), pp. 3344\u20133351. IEEE (2016)","DOI":"10.1109\/BigData.2016.7840994"},{"key":"425_CR15","unstructured":"Kennedy, W.S., Narayan, O., Saniee, I.: On the hyperbolicity of large-scale networks (2013). arXiv:1307.0031"},{"key":"425_CR16","doi-asserted-by":"crossref","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Facility dispersion problems: heuristics and special cases. In: Algorithms and Data Structures, pp. 355\u2013366. Springer (1991)","DOI":"10.1007\/BFb0028275"},{"issue":"3","key":"425_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/trsc.11.3.243","volume":"11","author":"DR Shier","year":"1977","unstructured":"Shier, D.R.: A min\u2013max theorem for p-center problems on a tree. Transp. Sci. 11(3), 243\u2013252 (1977)","journal-title":"Transp. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0425-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0425-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0425-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T01:22:23Z","timestamp":1570929743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0425-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":17,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0425-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"24 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}