A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system

Details A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system

2011-08-25

arxiv.org/abs/1108.4983v2

29th Symp. on Theoretical Aspects of Comp. Sci. (STACS 2012) 42-53

Computer Science

Data Structures and Algorithms

Scientific paper

10.4230/LIPIcs.STACS.2012.42

We consider the problem of maximizing a monotone submodular function in a $k$-exchange system. These systems, introduced by Feldman et al., generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems. Feldman et al. show that a simple non-oblivious local search algorithm attains a $(k + 1)/2$ approximation ratio for the problem of linear maximization in a $k$-exchange system. Here, we extend this approach to the case of monotone submodular objective functions. We give a deterministic, non-oblivious local search algorithm that attains an approximation ratio of $(k + 3)/2$ for the problem of maximizing a monotone submodular function in a $k$-exchange system.

Affiliated with

Also associated with

No associations

Rating

A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318486