“…Figure 2 illustrates an example with row A m = (2, 3, 3, 5, 2, 2, 4, 4), the representation of each entry a mn as rod, and the corresponding trajectories. By proving that the step size of the left leaf trajectory in any position n is an upper bound on the number of MUs of any other feasible decompositions, Kamath et al (2003) establish the optimality of the decomposition delivered by their algorithm SINGLEPAIR for the case of single row DT problems. In combination with Lemma 2.1, this yields the optimality of their solution algorithm MULTIPAIR for the unconstrained DT problem, which is, again, a validity proof of the sweep algorithm.…”