Maximizing k-submodular functions and beyond
We consider the maximization problem in the value oracle model of functions defined on $k$-tuples of sets that are submodular in every orthant and $r$-wise monotone, where $k\geq 2$ and $1\leq r\leq k$. We give an analysis of a deterministic greedy algorithm that shows that any such function can be...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Association for Computing Machinery
2016
|