Exact algorithms for budgeted prize-collecting covering subgraph problems

Nicola Morandi, Roel Leus, Hande Yaman

We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to…