From: Michelangelo Grigni (mic@mathcs.emory.edu)
Date: Thu May 03 2012 - 22:29:16 EDT
SC wrote: > You say "some bits of Chapter 6 (reductions)" will be on the exam. > I'm guessing that basically means Reductions, max/min flow and LP? Yes, those are the main topics from Chapter 6. > Will we need to know specifics about each > of these or just a strong understanding of the general ideas? We went through a specific algorithm for max-flow (the Ford-Fulkerson algorithm, plus some discussion on rules to pick augmenting paths). We did not look at an algorithm for LP, we just looked at some example reductions of familiar problems to LP (see share/0427/), and asserted that good LP solvers are available.
This archive was generated by hypermail 2.1.4 : Thu May 03 2012 - 22:29:47 EDT