Solving Combinatorial Optimization Problems using Distributed Approach

Combinatorial optimization is a way of finding an optimum solution from a finite set of objects. For combinatorial optimization problems, the number of possible solutions grows exponentially with the number of objects. These problems belong to the class of NP hard problems for which probably efficient algorithm does not exist. Using the distributed approach with parallelization these problems can be solved with a good bound. We show that how the concept of distributed algorithm can help in solving graph colouring problem i.e. one of the NP complete problem