Improved Approximation Algorithms for k-Submodular Function Maximization

  title={Improved Approximation Algorithms for k-Submodular Function Maximization},
  author={Satoru Iwata and Shin-ichi Tanigawa and Yuichi Yoshida},
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1+a)}-approximation by Ward and Živný [15], where a = max{1, √ (k − 1)/4}. We also show that for monotone ksubmodular functions there is a polynomial-time k/(2k− 1)-approximation algorithm while for any ε > 0 a ((k + 1)/2k + ε)-approximation algorithm for maximizing monotone k-submodular functions would require exponentially many… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 16 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
7 Citations
15 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 15 references

Bisubmodular function maximization and extensions

  • S. Iwata, S. Tanigawa, Y. Yoshida
  • Technical report, METR 2013-16, the University of…
  • 2013
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…