Art

J-GLOBAL ID：202002245142965921   Reference number：20A1394795

An Approximation Algorithm for the 2-Dispersion Problem

2分散問題に対する近似アルゴリズム

Author (2)： AMANO Kazuyuki (Gunma University) ,  NAKANO Shin-ichi (Gunma University)
Material： IEICE Transactions on Information and Systems (Web)  (IEICE Trans Inf Syst (Web))
Volume： E103.D  Issue： 3  Page： 506-508(J-STAGE)  Publication year： 2020 
JST Material Number： U0469A  ISSN： 1745-1361  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *dispersion ,  *approximation method ,  *set ,  point ,  subset ,  distance ,  integer ,  *approximate algorithm

Author keywords (2)： dispersion problem ,  approximation algorithm

JST classification (2)： Numerical computation  (JE02000J) ,  Numerical analysis,approximation method  (AB04000F)

Reference (12)：

• [1] K. Amano and S. Nakano, Away from Rivals, 30th Canadian Conference on Computational Geometry, Session 2B, University of Manitoba, Aug. 8-10, 2018.
• [2] C. Baur and S.P. Fekete, “Approximation of Geometric Dispersion Problems,” Proc. of APPROX '98, pp.63-75, 1998. 10.1007/bfb0053964
• [3] A. Cevallos, F. Eisenbrand, and R. Zenklusen, “Local search for max-sum diversification,” Proc. of SODA '17, pp.130-142, 2017. 10.1137/1.9781611974782.9
• [4] B. Chandra and M.M. Halldórsson, “Approximation Algorithms for Dispersion Problems,” J. of Algorithms, vol.38, no.2, pp.438-465, 2001. 10.1006/jagm.2000.1145
• [5] Z. Drezner, Facility Location: A Survey of Applications and Methods, Springer, 1995.

Terms in the title (1)： 近似アルゴリズム