Submodular optimisation lies at the heart of a broad class of combinatorial decision problems in which the objective exhibits diminishing marginal returns. Formally, a submodular function assigns a ...
Submodular maximization is a significant area of interest in combinatorial optimization, with numerous real-world applications. A research team led by Xiaoming SUN from the State Key Lab of Processors ...
Credit: Liu, X., Li, W. & Yang, J. The k -prize-collecting minimum vertex cover problem with submodular penalties (k -PCVCS) is a generalization of the minimum vertex cover problem, which is one of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results