{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:49:34Z","timestamp":1648619374306},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7398","type":"journal-article","created":{"date-parts":[[2017,4,30]],"date-time":"2017-04-30T22:15:07Z","timestamp":1493590507000},"page":"994-1002","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Approximate Algorithm for the 1-Median Problem on a Graph"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Koji","family":"TABATA","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuyoshi","family":"NAKAMURA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"KUDO","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] O. Alp, E. Erkut, and Z. Drezner, \u201cAn efficient genetic algorithm for the p-median problem,\u201d Annals of Operations research, vol.122(1-4), pp.21-42, 2003.","DOI":"10.1023\/A:1026130003508"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] R.E. Burkard and J. Krarup, \u201cA linear algorithm for the pos\/neg-weighted 1-median problem on a cactus,\u201d Computing, vol.60, no.3, pp.193-215, 1998.","DOI":"10.1007\/BF02684332"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M.L. Fredman and R.E. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms,\u201d J. ACM (JACM), vol.34, no.3, pp.596-615, 1987.","DOI":"10.1145\/28869.28874"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] L.C. Freeman, \u201cCentrality in social networks conceptual clarification,\u201d Social networks, vol.1, no.3, pp.215-239, 1978.","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A.J. Goldman, \u201cOptimal center location in simple networks,\u201d Transportation science, vol.5, no.2, pp.212-221, 1971.","DOI":"10.1287\/trsc.5.2.212"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S.L. Hakimi, \u201cOptimum locations of switching centers and the absolute centers and medians of a graph,\u201d Operations research, vol.12, no.3, pp.450-459, 1964.","DOI":"10.1287\/opre.12.3.450"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D.B. Johnson, \u201cEfficient algorithms for shortest paths in sparse networks,\u201d J. ACM (JACM), vol.24, no.1, pp.1-13, 1977.","DOI":"10.1145\/321992.321993"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] O. Kariv and S.L. Hakimi, \u201cAn algorithmic approach to network location problems. II: The p-medians,\u201d SIAM J. Applied Mathematics, vol.37, no.3, pp.539-560, 1979.","DOI":"10.1137\/0137041"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Y. Kochetov, T. Levanova, E. Alekseeva, and M. Loresh, \u201cLarge neighborhood local search for the p-median problem,\u201d Yugoslav J. Operations Research, vol.15, no.1, pp.53-66, 2005.","DOI":"10.2298\/YJOR0501053K"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] K. Okamoto, W. Chen, and X.-Y. Li, \u201cRanking of closeness centrality for large-scale social networks,\u201d International Workshop on Frontiers in Algorithmics, pp.186-195. Springer, 2008.","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] M.J. Rattigan, M. Maier, and D. Jensen, \u201cUsing structure indices for efficient approximation of network properties,\u201d Proc. 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 357-366, 2006.","DOI":"10.1145\/1150402.1150443"},{"key":"12","unstructured":"[12] M.G.C. Resende and R.F. Werneck, \u201cOn the implementation of a swap-based local search procedure for the p-median problem,\u201d Proc. Fifth Workshop on Algorithm Engineering and Experiments (ALENEX '03), pp.119-127, 2003."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] K. Tabata, A. Nakamura, and M. Kudo, \u201cFast approximation algorithm for the 1-median problem,\u201d Proc. 15th International Conference on Discovery Science, pp.169-183, 2012.","DOI":"10.1007\/978-3-642-33492-4_15"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] M. Thorup, \u201cUndirected single-source shortest paths with positive integer weights in linear time,\u201d J. ACM (JACM), vol.46, no.3, pp.362-394, 1999.","DOI":"10.1145\/316542.316548"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] D. Eppstein and J. Wang, \u201cFast approximation of centrality,\u201d J. Graph Algorithms and Applications, vol.8, no.1, pp.39-45, 2004.","DOI":"10.7155\/jgaa.00081"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/5\/E100.D_2016EDP7398\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T15:45:01Z","timestamp":1498405501000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/5\/E100.D_2016EDP7398\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7398","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}