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