24 citations · 72 across the 16 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 2 cited
On maximizing a monotone -submodular function under a knapsack constraint
Zhongzheng Tang, Chenhao Wang, Hau Chan
We study the problem of maximizing a non-negative monotone -submodular function under a knapsack constraint, where a -submodular function is a natural generalization of a…
cs.DS2021
Maximizing approximately k-submodular functions
Leqian Zheng, Hau Chan, Grigorios Loukides +1
We introduce the problem of maximizing approximately -submodular functions subject to size constraints. In this problem, one seeks to select -disjoint subsets of a ground set…