This preview shows page 1. Sign up to view the full content.
Unformatted text preview: he nodes. The problem is to
ﬁnd a closure (a closure is a subset C of V such that no arc (i, j ) ∈ A has i ∈ C and
j outside C ) with maximum total weight. Translate this problem into a max-ﬂow
min-cut problem and solve it.
T 1u 3u E c −2 u ' −1 u c
E −1 u 2 c
E −1 u...
View Full Document
This document was uploaded on 03/11/2014 for the course EOR Combinator at Tilburg University.
- Fall '14