Combinatorial Optimization

Prerequisites & course information

Optimization of combinatorial structures; computational complexity; stable marriages, shortest paths, maximum flows, minimum-cost flows, matching problems; approximation algorithms for NP-hard problems.