带有延迟时间下界的k-(n_1,1,…,1)-排序问题的拟多项式时间算法

Pseudo-polynomial Algorithm for the k-(n_1,1,...,1)-Chains Problem with Lower Bound Delays

研究Wikum提到的关于带有延迟时间下界的k (n1,1,…,1) 链形结构排序问题的拟多项式时间算法,其中n1=2的情况己得到解决,这里主要以n1=3的情形为例作更加细致的分析,然后给出此原来的算法更加有效的拟多项式时间算法.

Study the pseudo-polynomial algorithm for the k-(n_1,1,...,1)- chains problem with lower bound delays which was discussed by Wikum.The problem of n_1=2 has been solved.With the analysis of the problem of n_1=3,a more efficient algorithm will be given.