Network flow problems, network simplex method, max- flow min-cut problem, integral polyhedra, minimum- weight spanning tree problem, maximum matching problem, maximum stable set problem, introduction to approximation algorithms. Prerequisite(s): MATH 3801 or permission of the School. Lectures three hours a week, tutorial one hour a week. [0.5 credits]
Network flow problems, network simplex method, max- flow min-cut problem, integral polyhedra, minimum- weight spanning tree problem, maximum matching problem, maximum stable set problem, introduction to approximation algorithms. Prerequisite(s): MATH 3801 or permission of the School. Lectures three hours a week, tutorial one hour a week. [0.5 credits]
