Description
Problem 1 Max-flow variants
[DPV] Problem 7.18 parts c and d (max-flow variants using LP)
Note: For (d), assume you are trying to maximize flow into t, so as to capture the advantage
of paths that avoid particularly lossy nodes or that visit fewer nodes (and thus incur fewer losses).
[Think to yourself about why this clarification is necessary].
Problem 2 Reduction
[DPV] Problem 8.9 (Hitting set)
