lec17 - n CS 323/700 Lecture 17 o Design and Analysis of...

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

View Full Document Right Arrow Icon

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

View Full Document Right Arrow Icon

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n CS 323/700 Lecture 17 o Design and Analysis of Algorithms Hoeteck Wee · [email protected] http://algorithms.qwriting.org/ Announcements I Homework 9 out and due next week I Lecture schedule I Apr 28, May 3: randomized algorithms (lecture notes online) I May 5, May 10: review I Midterm 3 on May 12 (Wed) I greedy, dynamic programming, network flows Hoeteck Wee CS 323/700 Apr 26, 2010 2 / 6 Reductions COMMON THEME. I transform abstract problem into a graph problem I run a graph algorithm we know Hoeteck Wee CS 323/700 Apr 26, 2010 3 / 6 Reductions COMMON THEME. I transform abstract problem into a graph problem I run a graph algorithm we know NEXT. I transform abstract problem into a network flow problem: what are the nodes? source/sink? edges? capacities? I run Ford-Fulkerson to compute maximum flow I interprete maximum flow as solution to original problem I typically for problems involving matchings, e.g. applicants to jobs, students to colleges, etc Hoeteck Wee CS 323/700 Apr 26, 2010 3 / 6 Reductions...
View Full Document

{[ snackBarMessage ]}

Page1 / 11

lec17 - n CS 323/700 Lecture 17 o Design and Analysis of...

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

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