One of the common applications of greedy algorithms is for producing approximation solutions to NP-hard problems

Dijkstra algorithm

Read More

Maximal Flow Problem

max-flow min-cut theorem

the maximum amount of flow passing from the source to the sink is equal t...

ILP

ILP is NP-hard, therefore we can reduce any NP-complete optimization problem to ILP.

the optimal solution of the LP is only better than the optimal of ILP:every fea...

reduction (a technique usually used to show some problem is NP-hard).
it’s useful to know a good number of different NP-complete problems:When you encounter a new problem X and want to tr...

why tcp and http donot like each other

<...