OurBigBook About$ Donate
 Sign in Sign up

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

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

Solution

 0  0
iii
No for arbitrary signed weights. Give the same single hyperedge weight −1. For A={a} and B={b},
f(A)+f(B)=−2<0=f(A∩B)+f(A∪B).
(1)
This directly violates the defining inequality for a submodular set function.

 Ancestors (11)

  1. d
  2. 1
  3. Combinatorial optimisation
  4. 2023
  5. Past exam of the computer science course of the University of Oxford
  6. Computer science course of the University of Oxford
  7. Undergraduate course of the University of Oxford
  8. Course of the University of Oxford
  9. University of Oxford
  10. List of universities
  11.  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