আমরা জানি Overlapping subproblem থাকলে dynamic programming use করতে হয়। আমার প্রশ্ন হল overlapping subproblem এ greedy method কি apply করা যাবে optimization problem এর ক্ষেত্রে? নাকি overlapping subproblem থাকলে dynamic programming ই use করতে হবে?

asked 01 Oct, 17:06

sakibriyad's gravatar image

sakibriyad
212

edited 02 Oct, 00:26

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Question tags:

×191
×3
×3
×2
×1

question asked: 01 Oct, 17:06

question was seen: 89 times

last updated: 02 Oct, 00:26