## Generalized preprocessing techniques for Steiner tree and maximum-weight connected subgraph problems

This article introduces new reduction techniques for the Steiner tree problem in graphs (SPG) and one of its most popular relatives, the maximum-weight connected subgraph problem. Several of the techniques generalize previous results from the literature. In particular, we introduce a generalization of the Steiner bottleneck distanceâ€”the arguably most important reduction concept for SPG. While … Read more