Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
1Activity

Table Of Contents

Elements of Dynamic Programming
Optimal Sub-structure
Steps to Designing a Dynamic Programming Algorithm
Review: Matrix Multiplication
Matrix Chain Multiplication (MCM) Problem
Different Ordering
The Ordering Matters!
Step 2: Recursive (Recurrence) Formulation
Example
Step 4: Constructing an Optimal Solution
Recap: Elements of Dynamic Programming
Example: Traveling Salesman Problem
TSP
Summary
Greedy Algorithms
Applications of Greedy Algorithms
Greedy vsDynamic
Real-World Applications
Application: Activity-Selection Problem
Greedy Algorithm
Example Run
When does Greedy Work?
Greedy Choice Property
Application: Knapsack Problem
Knapsack Problem
Knapsack Problem: Greedy vsDynamic
Exercise (Traveling Salesman Problem)
Exercise (Interval Coloring Problem)
0 of .
Results for:
No results containing your search query
P. 1
greedy-dp

greedy-dp

Ratings: (0)|Views: 83|Likes:
Published by Abhigya Verma

More info:

Published by: Abhigya Verma on Jan 16, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/12/2011

pdf

text

original

You're Reading a Free Preview
Pages 6 to 57 are not shown in this preview.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->