1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2019★ 1 cited
An efficient branch-and-cut algorithm for approximately submodular function maximization
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
When approaching to problems in computer science, we often encounter situations where a subset of a finite set maximizing some utility function needs to be selected. Some of such u…
cs.DS2018
An efficient branch-and-bound algorithm for submodular function maximization
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
The submodular function maximization is an attractive optimization model that appears in many real applications. Although a variety of greedy algorithms quickly find good feasible…