An FPT approximation algorithm for the priority k-center problem

被引：0
|
作者：
Feng Q. [1 ,2 ]
Long R. [1 ]
Wu X. [1 ]
Zhong W. [3 ]
机构：
[1] School of Computer Science and Engineering, Central South University, Changsha
[2] Xiangjiang Laboratory, Changsha
[3] School of Foreign Languages, Central South University, Changsha
来源：
Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) | 2023年 / 54卷 / 07期
基金：
中国国家自然科学基金;
关键词：
approximation algorithm; FPT approximation algorithm; the k-center problem; the priority k-center problem;
D O I：
10.11817/j.issn.1672-7207.2023.07.018
中图分类号：
学科分类号：
摘要：
The priority k-center problem is a classical NP-hard problem in clustering. A set X of points in a metric space and a parameter k Î N+ were given where each point v Î X was entitled to a priority parameter r(v)Î R+, the goal was to find a subset S Í X with size k such that the maximum ratio between any point to its closest center in S and its priority parameter r(v) was minimized. For the priority k- center problem, the known best result is a 2 -; approximation in polynomial time and there exists no a (2-ϵ)-approximation algorithm for this problem (where ϵ is a parameter used to control the approximation ratio of algorithm). In this paper, the FPT approximation algorithm for the priority k- center problem was studied. Based on the greedy strategy used for the k- center problem,a new selection method was presented for centers. By using the greedy strategy, the method selects a set of candidate centers where the size can be upper bounded by the property of the doubling dimension, a (1 + ϵ)approximation in FPT time is achieved, and the known approximation ratio of this problem can be reduced. © 2023 Central South University of Technology. All rights reserved.
引用
收藏
页码：2718 / 2724
页数：6
相关论文
共 31 条
  • [1] ROKACH L, MAIMON O., Data mining and knowledge discovery handbook, pp. 321-352, (2006)
  • [2] KRIOUKOV D., Clustering implies geometry in networks, Physical Review Letters, 116, 20, (2016)
  • [3] ABUALIGAH L M, KHADER A T, HANANDEH E S., A combination of objective functions and hybrid krill herd algorithm for text document clustering analysis, Engineering Applications of Artificial Intelligence, 73, pp. 111-125, (2018)
  • [4] RACHID A D, ABDELLAH A, BELAID B, Et al., Clustering prediction techniques in defining and predicting customers defection: the case of e-commerce context, International Journal of Electrical and Computer Engineering, 8, 4, (2018)
  • [5] CHAUHAN D, UNNIKRISHNAN A, FIGLIOZZI M., Maximum coverage capacitated facility location problem with range constrained drones, Transportation Research Part C: Emerging Technologies, 99, pp. 1-18, (2019)
  • [6] BOULEMTAFES A, DERHAB A, CHALLAL Y., A review of privacy-preserving techniques for deep learning, Neurocomputing, 384, pp. 21-45, (2020)
  • [7] SINAGA K P, YANG M S., Unsupervised k-means clustering algorithm, IEEE Access, 8, pp. 80716-80727, (2020)
  • [8] HOCHBAUM D S, SHMOYS D B., A best possible heuristic for the k-center problem, Mathematics of Operations Research, 10, 2, pp. 180-184, (1985)
  • [9] HSU W L, NEMHAUSER G L., Easy and hard bottleneck location problems, Discrete Applied Mathematics, 1, 3, pp. 209-215, (1979)
  • [10] AHMADIAN S, NOROUZI-FARD A, SVENSSON O, Et al., Better guarantees for k-means and euclidean k-median by primal-dual algorithms, SIAM Journal on Computing, 49, 4, pp. 97-156, (2019)
1234