57 citations · 154 across the 36 of their papers we have counts for
1 paper · 1 filter
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich +3
In the prize-collecting Steiner forest (PCSF) problem, we are given an undirected graph G=(V,E), edge costs {ce≥0}e∈E, terminal pairs {(si,ti)}i=1k, and…