A 1-1/e approximation algorithm is proposed for monotone DR-submodular maximization under multiple order-consistent knapsack constraints on distributive lattices by generalizing continuous greedy using median complexes and uniform linear motions.
Braids, posets and orthosch emes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---
A 1-1/e approximation algorithm is proposed for monotone DR-submodular maximization under multiple order-consistent knapsack constraints on distributive lattices by generalizing continuous greedy using median complexes and uniform linear motions.