Functional Approach towards Approximation Problem
Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems and NP-hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best-suited solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned mentioned issues. Haskell is used in industries as well as in commercial applications, e.g., concurrent applications, statistics, symbolic math and financial analysis. Several approximation algorithms have been proposed for different problems that naturally arise in the DNA clone classifications. In this thesis, we have performed an initial and explorative study on applying functional languages for approximation algorithms. Specifically, we have implemented a well known approximate clustering algorithm both in Haskell and in Java and we discuss the suitability of applying functional languages for the implementation of approximation algorithms, in particular for graph theoretical approximate clustering problems with applications in DNA clone classification. We also further explore the characteristics of Haskell that makes it suitable for solving certain classes of problems that are hard to implement using imperative languages.
Place, publisher, year, edition, pages
2008. , 57 p.
Approximation algorithms, functional languages, imperative languages, bipartite graph, Haskell
IdentifiersURN: urn:nbn:se:bth-1245Local ID: oai:bth.se:arkivex36A305F7044FE452C12574D10058BC6DOAI: oai:DiVA.org:bth-1245DiVA: diva2:828408
Muhammad Imran Shafi: 29A Sodergatan 19547 Marsta, 0737171514, Muhammad Akram C/O Saad Bin Azhar Folkparksvagen 20/10 Ronneby, 07628991112015-05-222008-09-272015-06-30Bibliographically approved