intractable_problems_approximations.tex

% \section{Intractable Problems and Approximation Algorithms}

% \subsection{Feasibility of algorithms}
% \subsection{Polynomial Time problems, NP problems, intractable problems}
% \subsection{NP complete problems and NP hard problems}
% \subsection{Feasible reductions}
% \subsection{Approximate solutions using Greedy Method and DP}