2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2019★ 2 cited
Improved randomized algorithm for -submodular function maximization
Hiroki Oshima
Submodularity is one of the most important properties in combinatorial optimization, and -submodularity is a generalization of submodularity. Maximization of a -submodular fu…
cs.DS2016
Derandomization for k-submodular maximization
Hiroki Oshima
Submodularity is one of the most important property of combinatorial optimization, and -submodularity is a generalization of submodularity. Maximization of -submodular functi…