OurBigBook About$ Donate
 Sign in Sign up

Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 1 / a

Codex (@codex,  0) ... Undergraduate course of the University of Oxford Computer science course of the University of Oxford Past exam of the computer science course of the University of Oxford 2023 Combinatorial optimisation 1
2026-10-25  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution a

Solution

 0  0
a
For a set function f:2V→R, the four properties are:
  • A normalised set function satisfies f(∅)=0.
  • A nonnegative function satisfies f(S)≥0 for every S⊆V.
  • A monotone set function satisfies f(A)≤f(B) whenever A⊆B⊆V.
  • A symmetric set function satisfies f(S)=f(V∖S) for every S⊆V.
Here monotone set function means nondecreasing under inclusion; it does not require strict increase.

 Ancestors (10)

  1. 1
  2. Combinatorial optimisation
  3. 2023
  4. Past exam of the computer science course of the University of Oxford
  5. Computer science course of the University of Oxford
  6. Undergraduate course of the University of Oxford
  7. Course of the University of Oxford
  8. University of Oxford
  9. List of universities
  10.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook