A Tight Oracle Threshold for \(k\)-Submodular Maximization
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
The paper presents a new lower bound on the number of oracle queries required for a certain type of approximation algorithm, improving on previous work.
Before reading this…
Applications
- →Optimization
- →Machine learning
To understand this paper, make sure you know these concepts first:
- Approximation algorithmsfind papers →
- Submodular functionsfind papers →
Abstract
More Like ThisWe prove that, for every \(\varepsilon>0\), a \((\frac{k}{2k-1}+\varepsilon)\)-approximation algorithm for maximizing monotone \(k\)-submodular functions requires exponentially many value-oracle queries. This improves the \(\frac{k+1}{2k}\) oracle bound of Iwata, Tanigawa, and Yoshida. Their \(\frac{k}{2k-1}\)-approximation algorithm therefore gives the exact threshold in the monotone setting. For \(k\ge5\), our bound also matches, up to an arbitrarily small loss, Aggarwal's recent approximation guarantee for non-monotone \(k\)-submodular maximization.