Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy

In this paper, we concentrate on exploring fast algorithms for the minimization of a non-increasing supermodular or non-supermodular function f subject to a cardinality constraint. As for the non-supermodular minimization problem with the weak supermodularity ratio r , we can obtain a ( 1 + ϵ ) -app...

Ausführliche Beschreibung