Polynomial-time algorithms for shortest paths, optimum matchings, optimum network flows and other combinatorial optimization problems. Matroid greedy algorithm. Introduction to approximation algorithms for NP-hard problems. Introduction to polynomial-time recognition algorithms and optimization algorithms for specially structured graph classes.††
