WANG Xiaofeng, HUA Yingying, WANG Junxia, et al.Review of Algorithm Research on K-Center Problem[J]. Journal of Zhengzhou University(Engineering Science),2025,46(1):42-50. 作者介绍 1王晓峰 北方民族大学计算机科学与工程学院副教授,博士,硕士生导师。...
k-center problemminimum coverageThe k -center problem is a well-known facility location problem and can be described as follows: Given a complete undirected graph G =( V , E ), a metric d : V × V →ℝ + and a positive integer k , we seek a subset U ⊆ V of at ...
≤ d(e m) and let G i = (V, E i), where E i = {e1, e2, …, e i}. The k-center problem is equivalent to finding the smallest index i such that G i has a of size at most k. Dominating set：In , a dominating set for a G = (V, E) is a D of V such that ever...
常见例子有:装箱问题(Bin Packing)、背包问题(The Knapsack Problem)、纹理拼接问题(texture packing) 衡量近似算法 近似算法的得到的解不能太坏,不然我们就不用这个算法了。所以要能衡量这个算法的好坏,标准就是所得解与最优情况的比值,哪个放分母无所谓,但结果一定要大于1。 比值可能有小数位,变成大于它的最小...
Thek-Center Clustering problem can also be defined on a complete undirected graphG= (V,E) as follows: Given a complete undirected graphG= (V,E) with distancesd(vi,vj) ∈Nsatisfying the triangle inequality, find a subsetC⊆Vwith |C| =kwhile minimizing: ...
In this paper, we introduce and study the Non-Uniform k-Center problem (NUkC). Given a finite metric space (X,d) and a collection of balls of radii {r1≥⋯≥rk}, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation α, such...
In the bike-sharing system, inspired by the problem proposed by O’Mahony and Shmoys (AAAI 2015), we present a new model called the balanced k center problem with matching constraints. Given a network containing the same number of two types of points, supply points and demand points, we ...
The k-center problem is one of the important NP optimization problems. The capacitated k-center problem is its more practical variation. Although a 6-approximation algorithm has been proposed, it is considered to be ineffective. In this paper, we present three heuristic algorithms for the capacita...
In this paper, we introduce and study the Non-Uniform k-Center problem (NUkC). Given a finite metric space(X,d)and a collection of balls of radii{r1≥⋯≥rk}, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilationα, such that ...
In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points together with a distance function obeying the directed triangle inequality. The goal is to choose a set of k points to serve as centers and to assign all the points to the centers, so tha...