Lecture 19
11 March 2014
- Applcations of network flow
- Reductions between search problems
- LP, NP, NP-Completeness
Russell presented an example in which patients are assigned to studies. Unfortunately, I arrived too late to hear the problem description.
Next he moved onto an abstract description of reduction between problems.
I had to leave 5 minutes early.