一种贪心策略的更高效的请求集生成算法

A greedy strategy for more efficient request set generation algorithm

在折半循环编码算法的基础上,依据贪心策略对可纳入节点进行局部求最优的方式来生成请求集的算法,从而使算法的请求集长度下降了一个数量级,接近姨N。

Based on the Bin-cyclic, this paper generates the request set of algorithm by getting the local optimization solution of the demand nodes through greedy strategy. Thereby, the algorithm＇s the length of the request set drops an order of magnitude, which close to √N.