TY - GEN A1 - Rehfeldt, Daniel A1 - Koch, Thorsten T1 - Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP N2 - Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a central pillar of exact state-of-the-art solvers for well-known variants such as the Steiner tree problem in graphs. In this paper transformations for both the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to the Steiner arborescence problem are introduced for the first time. Furthermore, we demonstrate the considerable implications for practical solving approaches, including the computation of strong upper and lower bounds. T3 - ZIB-Report - 16-36 KW - graph transformation KW - Steiner tree problems KW - prize-collecting Steiner tree problem KW - maximum-weight connected subgraph problem Y1 - 2016 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/5977 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-59777 SN - 1438-0064 ER -