Lecture24 - Today's topics Problem Reductions CSE 421...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSE 421 Algorithms Richard Anderson Lecture 24 Network Flow Applications Today’s topics • Problem Reductions – Undirected Flow to Flow – Bipartite Matching – Disjoint Path Problem • Circulations • Lowerbound constraints on flows • Survey design Problem Reduction • Reduce Problem A to Problem B – Convert an instance of Problem A to an instance Problem B – Use a solution of Problem B to get a solution to Problem A •P r a c t i c a l – Use a program for Problem B to solve Problem A • Theoretical – Show that Problem B is at least as hard as Problem A Problem Reduction Examples • Reduce the problem of finding the Maximum of a set of integers to finding the Minimum of a set of integers Find the maximum of: 8, -3, 2, 12, 1, -6 Construct an equivalent minimization problem Undirected Network Flow • Undirected graph with edge capacities • Flow may go either direction along the edges (subject to the capacity constraints) u s
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/25/2012 for the course CSE 421 taught by Professor Richardanderson during the Fall '06 term at University of Washington.

Page1 / 4

Lecture24 - Today's topics Problem Reductions CSE 421...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online