# lect07 - Lecture 7 Variations of DP A problem on strip...

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

Lecture 7 Variations of DP

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

View Full Document
A problem on strip : outside weighted disks cover Inside points with minimum total weight. p 1 p 2 p i Ti(D,D’) : minimum weight set with D, D’, dominating p 1 , …, p i such that (1) D (lowest intersection point on L) among disks above the strip (2) D’( highest intersection point on L) among disks below the strip L
p 1 p 2 p i-1 D 1 (lowest intersection point on L) among disks above the strip, in T i (D,D’) D 2 (highest intersection point on L) among disks below the strip, in T i (D,D’) L

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

View Full Document
= - otherwise. 0 , if 1 ] [ where )} ( ] [ ) ( ] [ ) ( { min ) ( 1 1 2 1 2 1 1 , 2 1 D D D D D' c D' D + D c D D + ,D D T = D,D' T i D D i Dynamic Programming
= - otherwise. 0 , if 1 ] [ where )} ( ] [ ) ( ] [ )) ( ( { min )) ( ( 1 1 2 1 2 1 1 , 2 1 D D D D D' c D' D + D c D D + ,D D T w = D,D' T w i D D i Dynamic Programming

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

View Full Document
p j p i p i-1 D . does so ), 1 ( covers If 1 D i j p D j - < D1
DP-type Algorithm Design a table such that computing all elements in the table would solve the considered problem.

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.

## This note was uploaded on 11/03/2010 for the course COMPUTER S CS 6363 taught by Professor Dingzhudu during the Fall '10 term at University of Texas at Dallas, Richardson.

### Page1 / 15

lect07 - Lecture 7 Variations of DP A problem on strip...

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

View Full Document
Ask a homework question - tutors are online