Open Access
MATEC Web Conf.
Volume 232, 2018
2018 2nd International Conference on Electronic Information Technology and Computer Engineering (EITCE 2018)
Article Number 03022
Number of page(s) 4
Section Algorithm Study and Mathematical Application
Published online 19 November 2018
  1. Megiddo, N., Supowit, K.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 1182–1196 (1984) [CrossRef] [MathSciNet] [Google Scholar]
  2. Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to the euclidean P-center problem. Algorithmica 9, 1–22 (1993) [CrossRef] [Google Scholar]
  3. Chazelle, B., Matouˇsek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21, 579–597 (1996) [CrossRef] [Google Scholar]
  4. Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. Discret. Comput. Geom. 20, 287–305 (1998) [CrossRef] [Google Scholar]
  5. Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 131–138 (1997) [Google Scholar]
  6. Chan, T.M.: More planar two-center algorithms. Comput. Geom. Theor. Appl. 13, 189–198 (1999) [CrossRef] [Google Scholar]
  7. Dyer, M.E.: On a multidimensional search technique and its application to the Euclidean one-center problem. SIAM J. Comput. 15, 725–738 (1986) [CrossRef] [Google Scholar]
  8. Kim, S.K., Shin, C.-S.: Efficient algorithms for two-center problems for a convex polygon. In: Du, D.-Z.-Z., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 299-309. Springer, Heidelberg (2000). [Google Scholar]
  9. Tan X, Jiang B. Simple O(nlog2n)Algorithms for the Planar 2-Center Problem[C], International Computing and Combinatorics Conference. Springer, Cham, 2017: 481-491. [Google Scholar]
  10. Graham R L. An efficient algorith for determining the convex hull of a finite planar set. Information Processing Letters, 1972, 1(4):132-133. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.