A Parallel Approximation Algorithm for Maximizing Submodular $b$-Matching

S M Ferdous, Alex Pothen, Arif Khan +2

We design new serial and parallel approximation algorithms for computing a maximum weight $b$-matching in an edge-weighted graph with a submodular objective function. This problem…