We must know, we will know !
万物并作，吾以观复

This blog will review the key concepts and theorem from previous section.

From this blog, we begin to focus on approximation algorithms. And, this blog will talking about the defnition of approximation alogirthm and the techniques of analysis through Linear Programming.

This blog is talking about the concept of degeneracy. Which is actually a horrible situation in following algorithm called simplex we will going to talk about.

In the following blogs, we will focus on approximate algorithm. However, ahead of formally introdcuing this topic, we need to first introduce a strong tool that are useful in analysis and designing approximate algorithms – Linear Programing Problem and its dual problem.

Thsi blog is still talking about hardness of problems, focusing on NP, NP-Complete Problems.

This blog is talking about how to solve the basic solutions from LO problem.

The following blogs we will talks about the Hardness of Probelms that are P, NP, NPC problems. This blog will focus on reduction, and how to do reduction.

This blog talks about two applications of Max flow problem, that are bipartite matching problem and edge-disjoint path problem