Papers › Maximizing approximately k-submodular functions
Maximizing approximately k-submodular functions
Leqian Zheng, Hau Chan, Grigorios Loukides, Minming Li
We introduce the problem of maximizing approximately k-submodular functions subject to size constraints. In this problem, one seeks to select k-disjoint subsets of a ground set with bounded total size or individual sizes, and maximum utility, given by a function that is "close" to being k-submodular. The problem finds applications in tasks such as sensor placement, where one wishes to install k types of sensors whose measurements are noisy, and influence maximization, where one seeks to advertise k topics to users of a social network whose level of influence is uncertain. To deal with the problem, we first provide two natural definitions for approximately k-submodular functions and establish a hierarchical relationship between them. Next, we show that simple greedy algorithms offer approximation guarantees for different types of size constraints. Last, we demonstrate experimentally that the greedy algorithms are effective in sensor placement and influence maximization problems.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections