Functional Approach towards Approximation Problems
Suitability of applying functional languages for implementation of approximation algorithms
Versandkostenfrei!
Versandfertig in 6-10 Tagen
32,99 €
inkl. MwSt.
PAYBACK Punkte
16 °P sammeln!
Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems, NP- hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned issues. Haskell is used in industries as well in commercial applications, e.g. concurrent applications, statistics, symbolic math and financial analysis. Several approximation algorithms have...
Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems, NP- hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned issues. Haskell is used in industries as well 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 book, 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 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.
Andere Kunden interessierten sich für
