Study on Selected Greedy Algorithms

dc.contributor.author	Rahman, Fairooz Maliha
dc.contributor.author	Bhowmick, Supta
dc.contributor.author	Eva, Luthfun Naher
dc.contributor.author	Anu, Anwara Khatun
dc.date.accessioned	2018-03-05T07:01:34Z
dc.date.available	2018-03-05T07:01:34Z
dc.date.issued	2018-01-31
dc.identifier.uri	http://dspace.uiu.ac.bd/handle/52243/162
dc.description.abstract	We studied some Greedy Algorithms, implemented to observe the in depth functionalities. We used the main idea of Knapsack problem to solve some problems which are inspired by real life applications. Afterwards we thought of implementing MST with Genetic Algorithm. Genetic Algorithm is one of the most evolutionary methods in the field of computer science for solving optimization problem. With the help of Genetic Algorithm we designed an algorithm that makes it possible to solve MST problems more efficiently	en_US
dc.language.iso	en	en_US
dc.publisher	United International University	en_US
dc.subject	Greedy Algorithms	en_US
dc.subject	Minimum Spanning Tree	en_US
dc.subject	Single Source Shortest Path	en_US
dc.subject	Knapsack Algorithms	en_US
dc.title	Study on Selected Greedy Algorithms	en_US
dc.type	Thesis	en_US