This package maximizes the total prize with a budget constraint for an undirected node-weighted rooted graph loosely inspired Bateni 2018 algorithm from DOI:10.1137/15M102695X
0.0.1
This package maximizes the total prize with a budget constraint for an undirected node-weighted rooted graph very very loosely following Bateni 2018 algorithm from DOI:10.1137/15M102695X