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.
Weakly modular graphs and nonpositive curvature
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2019 2verdicts
UNVERDICTED 2representative citing papers
Proves geometric actions on weakly modular graphs for tilde A_n Coxeter groups via canonical embeddings into R^{n+1} and extends the result to tilde A_3 buildings.
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.
-
Weak Modularity and $\widetilde{A}_n$ Buildings
Proves geometric actions on weakly modular graphs for tilde A_n Coxeter groups via canonical embeddings into R^{n+1} and extends the result to tilde A_3 buildings.