{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:27:02Z","timestamp":1725892022955},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334917"},{"type":"electronic","value":"9783642334924"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33492-4_15","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T05:06:10Z","timestamp":1350882370000},"page":"169-183","source":"Crossref","is-referenced-by-count":2,"title":["Fast Approximation Algorithm for the 1-Median Problem"],"prefix":"10.1007","author":[{"given":"Koji","family":"Tabata","sequence":"first","affiliation":[]},{"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0378-4371(99)00291-5","volume":"272","author":"A. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications\u00a0272(1), 173\u2013187 (1999)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"15_CR2","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Akad. Kiad\u00f3 (1960)"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L. Freeman","year":"1979","unstructured":"Freeman, L.: Centrality in social networks conceptual clarification. Social Networks\u00a01(3), 215\u2013239 (1979)","journal-title":"Social Networks"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-20847-8_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Fujiwara","year":"2011","unstructured":"Fujiwara, Y., Onizuka, M., Kitsuregawa, M.: Efficient Centrality Monitoring for Time-Evolving Graphs. In: Huang, J.Z., Cao, L., Srivastava, J. (eds.) PAKDD 2011, Part II. LNCS, vol.\u00a06635, pp. 38\u201350. Springer, Heidelberg (2011)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 450\u2013459 (1964)","DOI":"10.1287\/opre.12.3.450"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Sublinear time algorithms for metric space problems. In: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pp. 428\u2013434. ACM (1999)","DOI":"10.1145\/301250.301366"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM (JACM)\u00a048(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM (JACM)"},{"key":"15_CR8","unstructured":"Leskovec, J.: Stanford large network dataset collection, http:\/\/snap.stanford.edu\/data\/index.html (accessed: May 04, 2012)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Rattigan, M., Maier, M., Jensen, D.: Using structure indices for efficient approximation of network properties. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 357\u2013366. ACM (2006)","DOI":"10.1145\/1150402.1150443"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM (JACM)\u00a046(3), 362\u2013394 (1999)","journal-title":"Journal of the ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33492-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:12:17Z","timestamp":1606169537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33492-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334917","9783642334924"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33492-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}