Let f:2N→Z+ be a polymatroid (an integer-valued non-decreasing submodular set function with f(∅)=0). A k-polymatroid satisfies that f(e)≤k for all e∈N. We call S⊆Nindependent if f(S)=∑e∈Sf(e) and f(e)>0 for all e∈S. Such a set was also called a matching. Finding a maximum-size independent set in a 2-polymatroid has been studied and polynomial-time algorithms are known for linear polymatroids. For k≥3, the problem is NP-hard, and a ((2/k)−ϵ)-approximation is known and is obtained by swapping as long as possible a subset of up to (1/ϵ)logk−1(2k+1) elements from the current solution by a set with one more element.Here we give a simple analysis of the more particular two-for-one repeated swapping heuristic, obtaining a tight (weaker) (2/(k+1))-approximation.
Read full abstract