{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:27:29Z","timestamp":1648729649721},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,3,1]]},"DOI":"10.1587\/transinf.2019fcp0005","type":"journal-article","created":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T22:11:01Z","timestamp":1583014261000},"page":"506-508","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation Algorithm for the 2-Dispersion Problem"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Kazuyuki","family":"AMANO","sequence":"first","affiliation":[{"name":"Gunma University"}]},{"given":"Shin-ichi","family":"NAKANO","sequence":"additional","affiliation":[{"name":"Gunma University"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] K. Amano and S. Nakano, Away from Rivals, 30th Canadian Conference on Computational Geometry, Session 2B, University of Manitoba, Aug. 8-10, 2018."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] C. Baur and S.P. Fekete, \u201cApproximation of Geometric Dispersion Problems,\u201d Proc. of APPROX '98, pp.63-75, 1998. 10.1007\/bfb0053964","DOI":"10.1007\/BFb0053964"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. Cevallos, F. Eisenbrand, and R. Zenklusen, \u201cLocal search for max-sum diversification,\u201d Proc. of SODA '17, pp.130-142, 2017. 10.1137\/1.9781611974782.9","DOI":"10.1137\/1.9781611974782.9"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] B. Chandra and M.M. Halld\u00f3rsson, \u201cApproximation Algorithms for Dispersion Problems,\u201d J. of Algorithms, vol.38, no.2, pp.438-465, 2001. 10.1006\/jagm.2000.1145","DOI":"10.1006\/jagm.2000.1145"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Z. Drezner, Facility Location: A Survey of Applications and Methods, Springer, 1995.","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"6","unstructured":"[6] Z. Drezner and H.W. Hamacher, Facility Location: Applications and Theory, Springer, 2004."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] R. Hassin, S. Rubinstein, and A. Tamir, \u201cApproximation Algorithms for Maximum Dispersion,\u201d Operations Research Letters, vol.21, no.3, pp.133-137, 1997. 10.1016\/s0167-6377(97)00034-5","DOI":"10.1016\/S0167-6377(97)00034-5"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T.L. Lei and R.L. Church, \u201cA unified model for dispersing facilities,\u201d Geographical Analysis, vol.45, no.4, pp.401-418, 2013. 10.1111\/gean.12020","DOI":"10.1111\/gean.12020"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] T.L. Lei and R.L. Church, \u201cOn the unified dispersion problem: Efficient formulations and exact algorithms,\u201d European Journal of Operational Research, vol.241, no.3, pp.622-630, 2015. 10.1016\/j.ejor.2014.10.020","DOI":"10.1016\/j.ejor.2014.10.020"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi, \u201cHeuristic and Special Case Algorithms for Dispersion Problems,\u201d Operations Research, vol.42, no.2, pp.299-310, 1994. 10.1287\/opre.42.2.299","DOI":"10.1287\/opre.42.2.299"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] M. Sydow, \u201cApproximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification,\u201d Mathematica Applicanda, vol.42, no.2, pp.241-257, 2014. 10.14708\/ma.v42i2.547","DOI":"10.14708\/ma.v42i2.547"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] D.W. Wang and Y.-S. Kuo, \u201cA study on Two Geometric Location Problems,\u201d Information Processing Letters, vol.28, no.6, pp.281-286, 1988. 10.1016\/0020-0190(88)90174-3","DOI":"10.1016\/0020-0190(88)90174-3"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/3\/E103.D_2019FCP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T03:26:57Z","timestamp":1583551617000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/3\/E103.D_2019FCP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,1]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019fcp0005","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,1]]}}}