In this paper, we prove that a greedy algorithm outputs a -approximate solution for nonnegative monotone -submodular maximization with a matroid constraint.

Feb 26, 2015 · Abstract. This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonneg- ative k-submodular functions.

This paper introduces three deterministic and approximation algorithms for the problem that significantly improve both the approximation ratio and query ...

Their notion is essentially k-center under partition matroid constraint. As mentioned earlier in the paper, our approach stud- ies a generalization of this ...

Jul 8, 2024 · Is there an approximation algorithm for the submodular maximization problem subject to a partition matroid? If so, what approximation does it ...

Feb 12, 2018 · Is there a known approximation algorithm for the problem of minimizing a monotone (non increasing) supermodular function under partition matroid ...

Our first result is a 16-approximation algorithm for the matroid median problem. As noted above, this also implies the first constant factor approximation for ...

The first and second constraints say that each client must be assigned to an open facility. The third constraint encodes the matroid independence constraint. An ...

Oct 24, 2008 · In this paper, we give the first constant-factor approximation algorithm for maximizing any non-negative submodular function subject to multiple ...

The Matroid Median problem is a generalization of the k-Median ... developed approximation algorithms for Priority k-Median and Priority k-Means problems;.