CSE331 Lecture 23

# CSE331 Lecture 23 - Lecture 23 CSE 331 Warning Will not...

This preview shows pages 1–12. Sign up to view the full content.

Lecture 23 CSE 331 Oct 24, 2011

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

View Full Document
Warning Will not always do COMPLETE proofs More work for YOU
Last lecture Convert optimal schedule O to Ô such that Ô has no inversions (a) Exists an inversion (i,j) such that i is scheduled right before j ( d i > d j ) (b) O’ has one less inversion than O (c) Max lateness( O’ ) Max lateness( O ) (a.5) Swap i and j to get O’ Repea t O(n 2 ) times Repea t O(n 2 ) times

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

View Full Document
Same lateness Same lateness Same lateness Max lateness( O’ ) ≤ Max lateness( O ) i i j j O i i j j O’ d i > d j Lateness of j in O’ ≤ Lateness of j in O Lateness of j in O’ ≤ Lateness of j in O Lateness of i in O’ ≤ Lateness of j in O Lateness of i in O’ ≤ Lateness of j in O Lateness of i in O’ = t 1 t 3 t 2 t 3 - d i < t 3 - d j = Lateness of j in O

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

View Full Document
Rest of today Shortest Path Problem http://xkcd.com/85/
Reading Assignment Sec 2.5 of [KT]

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

View Full Document
Shortest Path problem Input: Directed graph G=(V,E) Edge lengths, l e for e in E “start” vertex s in V Output:

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

View Full Document

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

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

{[ snackBarMessage ]}

### Page1 / 12

CSE331 Lecture 23 - Lecture 23 CSE 331 Warning Will not...

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

View Full Document
Ask a homework question - tutors are online