Lecture26 - Today's topics More network flow reductions CSE...

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 26 Network Flow Applications Today’s topics • More network flow reductions – Airplane scheduling – Image segmentation – Baseball elimination Airplane Scheduling • Given an airline schedule, and starting locations for the planes, is it possible to use a fixed set of planes to satisfy the schedule. • Schedule – [segments] Departure, arrival pairs (cities and times) • Approach – Construct a circulation problem where paths of flow give segments flown by each plane Example • Seattle->San Francisco, 9:00 – 11:00 • Seattle->Denver, 8:00 – 11:00 • San Francisco -> Los Angeles, 13:00 – 14:00 • Salt Lake City -> Los Angeles, 15:00-17:00 • San Diego -> Seattle, 17:30-> 20:00 • Los Angeles -> Seattle, 18:00->20:00 •F l i g h
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 / 3

Lecture26 - Today's topics More network flow reductions CSE...

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