Algorithms Bin Packing problem Bin Packing problem involves assigning n items of different weights and bins each of capacity c to a bin such that number of total used bins is minimized. It may be assumed that all items have weights smaller than bin capacity.

Approximation Algorithm Probabilistic / Approximate Counting [Complete Overview] We have introduced and explored the idea of Probabilistic algorithms in depth with the different algorithms like Morris Algorithm, HyperLogLog, LogLog and others in this domain.

Algorithms Approximate algorithms for NP problems We have covered Idea of Approximate algorithms for NP problems. NP problems are tough but Approximate algorithms are considered to be a good approach as we get a answer close to the real answer in reasonable time. We have covered the basics with examples of problems like Bin Packing.

Algorithms Approximation Algorithm for Travelling Salesman Problem In this article we will briefly discuss about the Metric Travelling Salesman Problem and an approximation algorithm named 2 approximation algorithm, that uses Minimum Spanning Tree in order to obtain an approximate path.

Algorithms Approximation Algorithms (Introduction) In this article we will be exploring an interesting as well as deep overview of Approximation Algorithms with examples like vertex cover problem, travelling salesman problem and more.