eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2012-02-24
42
53
10.4230/LIPIcs.STACS.2012.42
article
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems
Ward, Justin
We consider the monotone submodular k-set packing problem in the context of the more general problem of maximizing a monotone submodular function in a k-exchange system. These systems, introduced by Feldman et al. [Feldman,2011], generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems. We give a deterministic, non-oblivious local search algorithm that attains an approximation ratio of (k + 3)/2 + epsilon for the problem of maximizing a monotone submodular function in a k-exchange system, improving on the best known result of k+epsilon, and answering an open question posed by Feldman et al.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol014-stacs2012/LIPIcs.STACS.2012.42/LIPIcs.STACS.2012.42.pdf
k-set packing
k-exchange systems
submodular maximization
local search
approximation algorithms