Graph and Combinatorial Optimization (MS&E 212)

3 credits · Undergraduate

Optimization problems dealing with graph structure. Topics: introduction to graph theory; combinatorial optimization problems on networks including network flows, matching, and assignment problems; NP-completeness and approximation algorithms; applications in the study of social networks, market design, and bioinformatics. Prerequisites: basic concepts in linear algebra, probability theory, and programming methodology.