This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: v i and vertices in B . Otherwise, we add v i to B . This is equivalent to choosing where to put v i by maximizing the conditional expectation on the size of the cut given A ⊆ V and B ⊆ V \ V . This way we will end up with at least half of the edges having one vertex in A the other in B . Setting V = A we get a cut with the value ≥  E / 2.  1 MIT OpenCourseWare http://ocw.mit.edu 6.851 Advanced Data Structures Spring 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms ....
View
Full
Document
This note was uploaded on 03/31/2011 for the course EECS 6.851 taught by Professor Erikdemaine during the Spring '10 term at MIT.
 Spring '10
 ErikDemaine
 Data Structures

Click to edit the document details