prob02 - Problem Solving 2 Technique 1 Find a related...

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

View Full Document Right Arrow Icon
Problem Solving 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
Technique 1 Find a related optimization problem with self-reducibility. Solve the related problem by dynamic programming. Solve original problem.
Background image of page 2
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
Background image of page 3

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

View Full DocumentRight Arrow Icon
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
Background image of page 4
= - 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
Background image of page 5

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

View Full DocumentRight Arrow Icon
= - otherwise. 0 , if
Background image of page 6
Image of page 7
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

prob02 - Problem Solving 2 Technique 1 Find a related...

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

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