{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:50:24Z","timestamp":1743151824834,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319497860"},{"type":"electronic","value":"9783319497877"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49787-7_6","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T20:03:35Z","timestamp":1478721815000},"page":"60-73","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","author":[{"given":"Katherine","family":"Edwards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Kennedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iraj","family":"Saniee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"6_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 Science & Business Media, Berlin (1999)"},{"key":"6_CR2","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 24th Annual Symposium on Computational Geometry, pp. 59\u201368. ACM (2008)","DOI":"10.1145\/1377676.1377687"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-74208-1_5","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V Chepoi","year":"2007","unstructured":"Chepoi, V., Estellon, B.: Packing and covering \n                    \n                      \n                    \n                    $$\\delta $$\n                    \n                      \n                        \u03b4\n                      \n                    \n                  -hyperbolic spaces by balls. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX and RANDOM 2007. LNCS, vol. 4627, pp. 59\u201373. Springer, Heidelberg (2007)"},{"issue":"6","key":"6_CR4","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."},{"key":"6_CR5","unstructured":"Edwards, K., Kennedy, W.S., Saniee, I.: Fast approximation algorithms for \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -centres in large \n                    \n                      \n                    \n                    $$\\delta $$\n                    \n                      \n                        \u03b4\n                      \n                    \n                  -hyperbolic graphs (2016). arXiv preprint \n                    arXiv:1604.07359"},{"issue":"1","key":"6_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":"6_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":"6_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":"6_CR9","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":"6_CR10","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":"6_CR11","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":"6_CR12","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":"6_CR13","unstructured":"Kennedy, W.S., Narayan, O., Saniee, I.: On the hyperbolicity of large-scale networks. arXiv e-prints, June 2013"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BFb0028275","volume-title":"Algorithms and Data Structures","author":"SS Ravi","year":"1991","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Facility dispersion problems: heuristics and special cases. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 355\u2013366. Springer, Heidelberg (1991). doi:\n                    10.1007\/BFb0028275"},{"issue":"3","key":"6_CR15","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-max theorem for p-center problems on a tree. Transp. Sci. 11(3), 243\u2013252 (1977)","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49787-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:40:26Z","timestamp":1558316426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49787-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319497860","9783319497877"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49787-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"11 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.ryerson.ca\/waw2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}