In this paper, we present a 2-greedy routing algorithm for 3-connected plane graphs, where each vertex uses at least one but at most two virtual locations numbered from 1 to2n−1. For the special case of plane triangulations (in a plane triangulation, every face is a triangle, including...
Regarding approximation algorithms for the weighted k-set cover problem within a factor better than Hk, a first improvement step was given by Fujito and Okumura [6] who presented Hk − 1 12 -approximation algorithm for the k- set cover problem where the cost of each subset is either 1 ...
The $k$-batch greedy strategy is an approximate algorithm to solveoptimization problems where the optimal solution is hard to obtain. Startingwith the empty set, the $k$-batch greedy strategy adds a batch of $k$ elementsto the current solution set with the largest gain in the objective ...
algorithmApproximationalgorithmIn this paper, we consider the connected \\(k\\)-Center (\\(CkC\\)) problem, which can be seen as the classic \\(k\\)-Center problem with the constraint of internal connectedness, i.e., two nodes in a cluster are required to be connected by an internal...
内容提示: arXiv:1810.01834v2 [cs.DS] 4 Oct 2018Reverse Greedy is Bad for k-CenterD Ellis Hershkowitz and Gregory KehneAbstractWe demonstrate that the reverse greedy algorithm is a Θ(k) approximation for k-center.1 IntroductionWhereas greedy algorithms greedily add to a solution provided ...
We present a simple and fast deterministic algorithm for the minimum k-way cut problem in a capacitated graph, that is, finding a set of edges with minimum total capacity whose removal splits the graph into at least k components. The algorithm packs O(mk(3) log n) trees. Each new tree...
In this paper, we present a 2-greedy routing algorithm for 3-connected plane graphs, where each vertex uses at least one but at most two virtual locations numbered from 1 to 2 n − 1 . For the special case of plane triangulations (in a plane triangulation, every face is a triangle,...
Time series prediction using backpropagation network optimized by hybrid K-means-Greedy algorithm. Engineering Letters, 20, 3, 203-210.J. Y. B. Tan, D. B. L. Bong, and A. R. H. Rigit, "Time Series Prediction using Backpropagation Network Optimized by Hybrid K- means-Greedy Algorithm,...
Optimal clustering of co-regulated genes is critical for reliable inference of the underlying biological processes in gene expression analysis, for which the K-means algorithm have been widely employed for its efficiency. However, given that the solution space is large and multimodal, which is ...
Optimal clustering of co-regulated genes is critical for reliable inference of the underlying biological processes in gene expression analysis, for which the K-means algorithm have been widely employed for its efficiency. However, given that the solution space is large and multimodal, which is ...