tailieunhanh - Lecture Algorithm design - Chapter 7: Network flow II

Lecture Algorithm design - Chapter 7 "Network flow II" include all of the following: Bipartite matching, disjoint paths, extensions to max flow, survey design, airline scheduling, image segmentation, project selection, baseball elimination. | Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 2013 Kevin Wayne http wayne kleinberg-tardos 7. Network Flow II bipartite matching disjoint paths extensions to max flow survey design airline scheduling image segmentation project selection baseball elimination Last updated on Dec 23 2013 3 31 PM Soviet rail network 1950s Free world goal. Cut supplies if cold war turns into real war . Reference On the history of the transportation and maximum flow problems. Alexander Schrijver in Math Programming 91 3 2002. 2 Max-flow and min-cut applications Max-flow and min-cut are widely applicable problem-solving model. Data mining. Open-pit mining. Bipartite matching. Network reliability. BasebaH elimination. Image segmentation. Network connectivity. Distributed computing. Security of statistical data. Egalitarian stable matching. Network intrusion detection. Multi-camera scene reconstruction. Sensor placement for homeland security. Many many more. liver and hepatic vascularization segmentation