ByNobleID
    Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost | NobleID