Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization

2021 
Given a set V, the problem of unconstrained submodular maximization with modular costs (USM-MC) asks for a subset S V that maximizes f(S) - c(S), where f is a non-negative, monotone, and submodular...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    22
    References
    0
    Citations
    NaN
    KQI
    []