Description
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.
Prerequisites
- Prerequisite(s): MATH 3801 or permission of the School.
Conditions and arrangements
- Prerequisite(s): MATH 3801 or permission of the School.
- Lectures three hours a week, tutorial one hour a week.
Reference text in its original language
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.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/