lect notes-DynamicProgramming

lect notes-DynamicProgramming - Outline Chapter 1 1.1 1.2...

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

View Full Document Right Arrow Icon
Outline • Chapter 1: – 1.1, 1.2, 1.3, 1.4, 1.7, 1.8 • Chapter 3: Dynamic Programming • Chapter 5: Binary Tree • Chapter 6: Selected sections • Chapter 2
Background image of page 1

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

View Full DocumentRight Arrow Icon
Interval Scheduling Problem • Given n intervals of v i and lengths w i . Find the subset of compatible intervals of maximum total value.
Background image of page 2
Interval Scheduling Problem: Example 0 1 2 3 4 5 6 7 8 3 •(s 1 , f 1 ) = (0, 2) •(s 2 , f 2 ) = (1, 3) •(s 3 , f 3 ) = (0, 4) •(s 4 , f 4 ) = (4, 7) •(s 5 , f 5 ) = (6, 7) Interval 1 Interval 2 Interval 3 Interval 4 Interval 5 Starting and finishing points of the interval 2 2 5 4
Background image of page 3

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

View Full DocumentRight Arrow Icon
Interval Scheduling Problem: Ideas • Sort intervals by f i • Define F(n) to be the maximum return • F(n) either – Includes (s n , f n ) or – Does not include (s n , f n ) • p(n) subset ~ F(n) – p(1) = 0 – p(2) = 0 – p(5) = 3
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

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

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

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

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13

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

View Full DocumentRight Arrow Icon
Background image of page 14
Background image of page 15

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

View Full DocumentRight Arrow Icon
Background image of page 16
Background image of page 17

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

View Full DocumentRight Arrow Icon
Background image of page 18
Background image of page 19

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

View Full DocumentRight Arrow Icon
Background image of page 20
Background image of page 21

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

View Full DocumentRight Arrow Icon
Multiterminal Shortest Paths d ik min(d ik , d ij + d jk ) for j = 1, 2, …, n; forall i,k j p ik = p ij if d ik > d ij + d jk same if d ik d ij + d jk 1 2 3 4 7 12 3 4
Background image of page 22
Multiterminal Shortest Paths 1 2 3 4 7 12 3 4 1 2 3 7 3 4 4 j=1 5 1 234 1 1 1 1 2 3 4 1 2 3 4 1 234 1134 1 2 3
Background image of page 23

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

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

This note was uploaded on 02/19/2008 for the course CSE 202 taught by Professor Hu during the Fall '06 term at UCSD.

Page1 / 36

lect notes-DynamicProgramming - Outline Chapter 1 1.1 1.2...

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

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