摘要
In this note we give a rather good approximate algorithm of optimal digit-grouped partition of sequences, showing that the optimal complete digit-grouped partition number of a dumbbell type sequence S is equal to its optimal digit-grouped partition number N(S), hence an estimation of N(S) is obtained. The thickness of a sequence introduced in this note is a key.
