Superadditive set function: Difference between revisions
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 be a set function, where denotes the power set of . The function f is superadditive if for any pair of disjoint subsets of , we have .[1]