A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice

We consider a knapsack-constrained maximization problem of a nonnegative monotone DR-submodular function f over a bounded integer lattice [ B ] in R + n , max { f ( x ) : x ∈ [ B ] and ∑ i = 1 n x ( i ) c ( i ) ≤ 1 } , where n is the cardinality of a ground set N and c ( · ) is a cost function defin...

Ausführliche Beschreibung