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 ...
Specifically, if the penalty function is linear, Algorithm 2 is a 2-approximation algorithm. Future work can focus on studying the version with general penalties, such as, subadditive or supermodular ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results