Lecture Notes Discrete Optimization - Applied Mathematics
Lecture Notes Discrete Optimization - Applied Mathematics
Lecture Notes Discrete Optimization - Applied Mathematics
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Contents<br />
1 Preliminaries 1<br />
1.1 <strong>Optimization</strong> Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . 1<br />
1.2 Algorithms and Efficiency . . . . . . . . . . . . . . . . . . . . . . . . . 2<br />
1.3 Growth of Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3<br />
1.4 Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3<br />
1.5 Sets, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4<br />
1.6 Basics of Linear Programming Theory . . . . . . . . . . . . . . . . . . . 5<br />
2 Minimum Spanning Trees 7<br />
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7<br />
2.2 Coloring Procedure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7<br />
2.3 Kruskal’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10<br />
2.4 Prim’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12<br />
3 Matroids 14<br />
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14<br />
3.2 Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15<br />
3.3 Greedy Algorithm for Matroids . . . . . . . . . . . . . . . . . . . . . . . 16<br />
4 Shortest Paths 18<br />
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18<br />
4.2 Single Source Shortest Path Problem . . . . . . . . . . . . . . . . . . . . 18<br />
4.2.1 Basic properties of shortest paths . . . . . . . . . . . . . . . . . 19<br />
4.2.2 Arbitrary cost functions . . . . . . . . . . . . . . . . . . . . . . 21<br />
4.2.3 Nonnegative cost functions . . . . . . . . . . . . . . . . . . . . . 22<br />
4.3 All-pairs Shortest-path Problem . . . . . . . . . . . . . . . . . . . . . . 23<br />
5 Maximum Flows 27<br />
iii