The Steiner Shortest Path Tree Problem

Omer Asher, Yefim Dinitz, Shlomi Dolev +2

We introduce and study a novel problem of computing a shortest path tree with a minimum number of non-terminals. It can be viewed as an (unweighted) Steiner Shortest Path Tree (SSP…