Cut and patch Steiner trees for ladders Original Research Article

In this paper we deal with the Steiner minimal tree problem for a special type of point sets called ladders. We give a counterexample to the so-called ‘cut and patch tree method’ described in several former papers. Moreover, we explain how to modify this method such that it provides always an optimal solution.