Algorithms for graph problems such as maximum flow, matching, network reliability, minimum cuts, covering, coloring, planarity, shortest paths, and connectivity. Crosslisted with CS 7510 and ISYE 7510.
Fundamental combinatorial structures including hypergraphs, transversal sets, colorings, Sperner families, intersecting families, packings and coverings, perfect graphs, and Ramsey theory. Algebraic and topological methods, applications.
Fundamentals of statistical inference are presented and developed for models used in the modern analysis of financial data. Techniques are motivated by examples and developed in the context of applications. Crosslisted with ISYE 6783.