• mathematics, a submodular set function (also known as a submodular function) is a set function that, informally, describes the relationship between a set of inputs...
    22 KB (3,349 words) - 01:08, 20 June 2025
  • (strictly) supermodular then f is called (strictly) submodular. A function that is both submodular and supermodular is called modular. This corresponds...
    9 KB (1,230 words) - 01:51, 24 May 2025
  • flow out, and have minimum total cost. In submodular flow, as well, one is given a submodular set function on sets of vertices of the graph. Instead of obeying...
    3 KB (352 words) - 22:55, 28 November 2023
  • naturally model summarization problems are TextRank and PageRank, Submodular set function, Determinantal point process, maximal marginal relevance (MMR)...
    52 KB (6,821 words) - 21:53, 16 July 2025
  • mathematics Submodular set function – Set-to-real map with diminishing returns Subadditive set function τ-additivity ba space – The set of bounded charges...
    10 KB (1,649 words) - 17:33, 18 July 2025
  • mathematics, especially measure theory, a set function is a function whose domain is a family of subsets of some given set and that (usually) takes its values...
    43 KB (7,470 words) - 06:33, 17 October 2024
  • submodular set function is subadditive (the family of non-negative submodular functions is strictly contained in the family of subadditive functions)...
    4 KB (585 words) - 19:41, 19 February 2025
  • Thumbnail for Matroid rank
    may be axiomatized. Matroid rank functions form an important subclass of the submodular set functions. The rank functions of matroids defined from certain...
    11 KB (1,426 words) - 09:36, 27 May 2025
  • Thumbnail for Greedy algorithm
    solve it optimally. A function f {\displaystyle f} defined on subsets of a set Ω {\displaystyle \Omega } is called submodular if for every S , T ⊆ Ω...
    18 KB (1,964 words) - 16:36, 25 July 2025
  • Thumbnail for Diminishing returns
    of resources Self-organized criticality – Concept in physics Submodular set function – Set-to-real map with diminishing returns Sunk-cost fallacy – Cost...
    23 KB (2,907 words) - 10:37, 26 June 2025
  • submodular agent has a utility function that is a submodular set function. This means that the agent's utility has decreasing marginals. Submodular utilities...
    21 KB (2,835 words) - 22:59, 22 May 2025
  • a pseudo-Boolean function. The submodular set functions can be viewed as a special class of pseudo-Boolean functions, which is equivalent to the condition...
    7 KB (1,141 words) - 04:13, 21 June 2025
  • Thumbnail for Hadas Shachnai
    knapsack problems, interval scheduling, and the optimization of submodular set functions. She is a professor of computer science at the Technion – Israel...
    4 KB (289 words) - 20:11, 3 November 2024
  • been defined over sets, through a submodular set function which is known as the discrete analog of a convex function. The submodular Bregman divergences...
    26 KB (4,475 words) - 08:02, 12 January 2025
  • Theory of Greedy Algorithms Archived 2016-03-04 at the Wayback Machine Submodular Functions and Optimization Matchings, Matroids and Submodular Functions...
    12 KB (1,736 words) - 07:06, 10 May 2025
  • {\displaystyle u} is a subadditive set function. Assuming u ( ∅ ) {\displaystyle u(\emptyset )} is non-negative, every submodular function is subadditive. However...
    12 KB (1,808 words) - 15:21, 5 April 2021
  • Maximum coverage problem (category Families of sets)
    submodular set functions I, Mathematical Programming 14 (1978), 265–294 Hochbaum, Dorit S. (1997). "Approximating Covering and Packing Problems: Set Cover...
    10 KB (1,762 words) - 21:56, 27 December 2024
  • In mathematics, a polymatroid is a polytope associated with a submodular function. The notion was introduced by Jack Edmonds in 1970. It is also a generalization...
    7 KB (1,259 words) - 13:21, 8 July 2025
  • Fractionally subadditive valuation (category Utility function types)
    _{i}v(T_{i})} . Every submodular set function is XOS, and every XOS function is a subadditive set function. See also: Utility functions on indivisible goods...
    5 KB (859 words) - 06:08, 15 July 2025
  • game is called submodular if (a) the set of feasible joint decisions is a sublattice; (b) the cost function of each player is submodular and has antitone...
    48 KB (6,102 words) - 13:16, 4 August 2025
  • Additive utility (category Utility function types)
    functions on indivisible goods Independent goods Submodular set function Supermodular set function Brandt, Felix; Conitzer, Vincent; Endriss, Ulle; Lang...
    2 KB (289 words) - 22:58, 21 April 2024
  • Gross substitutes (indivisible items) (category Utility function types)
    valuation is a submodular set function. The converse is not necessarily true. This is shown by the example on the right. The utility is submodular since it...
    13 KB (2,334 words) - 21:55, 23 May 2025
  • allows for simpler optimization while maintaining sparsity. See: Submodular set function Besides the norms discussed above, other norms used in structured...
    24 KB (3,812 words) - 20:48, 26 October 2023
  • is bounded in several cases. For example, when the cost function is a submodular set function (as in the above example), the correlation gap is at most...
    3 KB (512 words) - 12:54, 5 July 2022
  • Unit demand (category Utility function types)
    is an extreme case of a submodular set function. It is characteristic of items that are pure substitute goods. Utility functions on indivisible goods Matching...
    2 KB (331 words) - 03:05, 14 December 2019
  • Thumbnail for Laurence Wolsey
    Fisher (1978). "An analysis of approximations for maximizing submodular set functions I". Mathematical Programming A. 14: 265–294. doi:10.1007/BF01588971...
    7 KB (601 words) - 16:43, 2 September 2024
  • −sur(G; X)] In a bipartite graph G = (X+Y, E), the surplus function is a submodular set function: for every two subsets X1, X2 of X: sur G ⁡ ( X 1 ∪ X 2...
    7 KB (1,145 words) - 23:27, 29 June 2025
  • Kulik, Ariel; Shachnai, Hadas; Tamir, Tami (2009), "Maximizing submodular set functions subject to multiple linear constraints", in Mathieu, Claire (ed...
    5 KB (387 words) - 02:21, 2 June 2025
  • theory", as well as matchings in graphs, include incidence matrices, submodular set functions, independent matchings in matroids, the Birkhoff–von Neumann theorem...
    8 KB (861 words) - 23:46, 30 May 2025
  • Thumbnail for George Nemhauser
    Fisher, M. L. (1978), "An analysis of approximations for maximizing submodular set functions I", Mathematical Programming, 14 (1): 265–294, doi:10.1007/BF01588971...
    9 KB (658 words) - 01:59, 4 June 2025