“…Briefly, the prize-collecting Steiner forest (Tuncbag et al, 2013, 2016) aims to find a forest F ( V F , E F ) from the graph G(V, E, c(e), p(v)) , with nodes V , edges E , edge costs c(e) ≥ 0, and node prizes p(v) for v ∈ V , that minimizes the objective function:
where κ represents the number of trees in the forest, ω represents a tuning parameter that influences the number of trees included in the final forest, and:
…”