-
Subspace Selection via DR-Submodular Maximization on Lattices
The subspace selection problem seeks a subspace that maximizes an object...
05/18/2018 ∙ by So Nakashima, et al. ∙
0
∙
share
read it
-
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---
We consider a problem of maximizing a monotone DR-submodular function un...
07/09/2019 ∙ by Takanori Maehara, et al. ∙
0
∙
share
read it
