Consider the network v a below with weights on the

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: he nodes. The problem is to find 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-flow min-cut problem and solve it. 2u 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.

Ask a homework question - tutors are online