Show simple item record

dc.contributor.authorRahman, Fairooz Maliha
dc.contributor.authorBhowmick, Supta
dc.contributor.authorEva, Luthfun Naher
dc.contributor.authorAnu, Anwara Khatun
dc.date.accessioned2018-03-05T07:01:34Z
dc.date.available2018-03-05T07:01:34Z
dc.date.issued2018-01-31
dc.identifier.urihttp://dspace.uiu.ac.bd/handle/52243/162
dc.description.abstractWe 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 efficientlyen_US
dc.language.isoenen_US
dc.publisherUnited International Universityen_US
dc.subjectGreedy Algorithmsen_US
dc.subjectMinimum Spanning Treeen_US
dc.subjectSingle Source Shortest Pathen_US
dc.subjectKnapsack Algorithmsen_US
dc.titleStudy on Selected Greedy Algorithmsen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record