Call For Paper Volume:4 Issue:6 Jun'2017

Comparative Analysis of Dynamic and Greedy Approaches for Dynamic Programming

Publication Date : 31/07/2014



Author(s) :

Jay Vala , Jaymit Pandya , Dhara Monka.


Volume/Issue :
Volume 1
,
Issue 1
(07 - 2014)



Abstract :

This paper analyze few algorithms of the 0/1 Knapsack Problem and fractional knapsack problem. This problem is a combinatorial optimization problem in which one has to maximize the benefit of objects without exceeding capacity. As it is an NP-complete problem, an exact solution for a large input is not possible. Hence, paper presents a comparative study of the Greedy and dynamic methods. It also gives complexity of each algorithm with respect to time and space requirements. Our experimental results show that the most promising approaches are dynamic programming.


No. of Downloads :

16


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

Comparative Analysis of Dynamic and Greedy Approaches for Dynamic Programming

December 2, 2014