1
$\begingroup$

Is there a known approximation algorithm for the problem of minimizing a monotone (non increasing) supermodular function under partition matroid constraints ?

$\endgroup$
2
$\begingroup$

Consider a graph $G=(V,E)$. Define the set function $f$ over $V$ where $f(A)$ is the number of edges with both end points in $A$. Then $f$ is supermodular and monotone. Suppose $G$ has an independent set of size $k$. Then the minimum of $f(S)$ under the constraints $|S| = k$ (the uniform matroid constraint) will be $0$. If $G$ does not have an independent set of size $k$ then the min will be at least $1$. Hence the problem is inapproximable.

$\endgroup$

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.