Superadditive set function: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>Citation bot
Alter: title, author. | Use this bot. Report bugs. | Suggested by Abductive | Category:Approximation algorithms | #UCB_Category 25/39
 
(No difference)

Latest revision as of 08:38, 7 August 2024

In mathematics, a superadditive set function is a set function whose value when applied to the union of two disjoint sets is greater than or equal to the sum of values of the function applied to each of the sets separately. This definition is analogous to the notion of superadditivity for real-valued functions. It is contrasted to subadditive set function.

Definition

Let Ω be a set and f:2Ω be a set function, where 2Ω denotes the power set of Ω. The function f is superadditive if for any pair of disjoint subsets S,T of Ω, we have f(S)+f(T)f(ST).[1]

See also

Citations

Template:Reflist