24 citations · 27 across the 3 of their papers we have counts for
1 paper · 1 filter
Jochen Könemann, Sina Sadeghian, Laura Sanità
In the node-weighted prize-collecting Steiner tree problem (NW-PCST) we are given an undirected graph G=(V,E), non-negative costs c(v) and penalties π(v) for each v∈V.…