Randomized approximation algorithms for monotone k-submodular function maximization with constraints

• Published in: Journal of combinatorial optimization Vol. 49; no. 4; p. 64
• Main Authors: Li, Yuying, Li, Min, Zhou, Yang, Niu, Shuxian, Liu, Qian
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.05.2025; Springer Nature B.V
• Subjects: Algorithms; Approximation; Combinatorics; Complexity; Constraints; Convex and Discrete Geometry; Guarantees; Mathematical Modeling and Industrial Mathematics; Mathematics; Mathematics and Statistics; Maximization; Operations Research/Decision Theory; Optimization; Placement; Sensors; Theory of Computation; Upper bounds; Submodular function; Randomized algorithms; Approximation algorithms; Matroid constraints; Individual size constraints
• ISSN: 1382-6905; 1573-2886
• DOI: 10.1007/s10878-025-01299-y

In recent years, k -submodular functions have garnered significant attention due to their natural extension of submodular functions and their practical applications, such as influence maximization and sensor placement. Influence maximization involves selecting a set of nodes in a network to maximize the spread of information, while sensor placement focuses on optimizing the locations of sensors to maximize coverage or detection efficiency. This paper first proposes two randomized algorithms aimed at improving the approximation ratio for maximizing monotone k -submodular functions under matroid constraints and individual size constraints. Under the matroid constraints, we design a randomized algorithm with an approximation ratio of nk 2 n k - 1 and a complexity of O ( r n ( RO + k EO ) ) , where n represents the total number of elements in the ground set, k represents the number of disjoint sets in a k -submodular function, r denotes the size of the largest independent set, RO indicates the time required for the matroid’s independence oracle, and EO denotes the time required for the evaluation oracle of the k -submodular function.Meanwhile, under the individual size constraints, we achieve an approximation factor of nk 3 n k - 2 with a complexity of O ( knB ), where n is the total count of elements in the ground set, and B is the upper bound on the total size of the k disjoint subsets, belonging to Z + . Additionally, this paper designs two double randomized algorithms to accelerate the algorithm’s running speed while maintaining the same approximation ratio, with success probabilities of ( 1 - δ ), where δ is a positive parameter input by the algorithms. Under the matroid constraint, the complexity is reduced to O ( n log r log r δ ( RO + k EO ) ) . Under the individual size constraint, the complexity becomes O ( k 2 n log B k log B δ ) .