3 citations · 5 across the 6 of their papers we have counts for
1 paper · 1 filter
Kevin Byrnes
We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut functio…