Evaluation of Standard Greedy Approach for Networking Algorithms

Abstract: Algorithm in general terms is set of rules to be followed for doing a calculation. In computer science, an algorithm is a finite set of steps of well-defined instructions to perform a particular task or to solve a well-defined problem. Various type of algorithm is developed and used in the field of networking. Some may be divide and conquer algorithm other may follows the standards of dynamic programming and some may follow the greedy approach. Greedy is an algorithmic paradigm that builds up a solution piece by piece. Greedy algorithm always chooses the piece that offers the most obvious and immediate and nearest benefit. So, this problem was choosing locally optimal also leads to globally solution that is best fit for Greedy.

Keywords: Knapsack problem, Standard greedy algorithms, Graph map colouring, Graph vertex cover, Kruskal algorithm, Prim’s Algorithm, Job scheduling.