English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We consider the problem of maximizing a monotone submodular function in a$k$-exchange system. These systems, introduced by Feldman et al., generalizethe matroid k-parity problem in a wide class of matroids and capture many othercombinatorial optimization problems. Feldman et al. show that a simplenon-oblivious local search algorithm attains a $(k + 1)/2$ approximation ratiofor the problem of linear maximization in a $k$-exchange system. Here, weextend this approach to the case of monotone submodular objective functions. Wegive a deterministic, non-oblivious local search algorithm that attains anapproximation ratio of $(k + 3)/2$ for the problem of maximizing a monotonesubmodular function in a $k$-exchange system.

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