Jul 21, 2019 · We study a greedy algorithm applied to non-submodular optimization with p-independence system constraint, and show the algorithm preserves some ...
scholar.google.com › citations
In this paper, we study the maximization of the non-submodular objective functions under the non-submodular constraint.
Nov 19, 2018 · In this paper, we study the problem of maximizing a non-submodular nondecreasing set function subject to a general matroid constraint.
We investigate a non-submodular maximization problem subject to a p-independence system constraint, where the non-submodularity of the utility function is ...
Weak submodularity implies localizability: Local search for ...
www.sciencedirect.com › article › pii
In this paper, we explore the problem of maximizing a monotone non-submodular function under a p-matroid ( ) constraint with local search algorithms.
Our idea of using existing algorithms for monotone functions to solve the non-monotone case also works for maximizing a submodular function with respect to a ...
Abstract. We propose and analyze batch greedy heuristics for cardinality constrained maximization of non-submodular non-decreasing set functions.
We investigate the performance of the standard. GREEDY algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions.
Jan 19, 2022 · In this paper, we firstly study the problem of maximizing a γ -weakly DR-submodular function under a general matroid constraint.
May 7, 2023 · We consider the problem of maximizing a monotone nondecreasing set function under multiple constraints, where the constraints are also characterized by ...