diff --git a/main.tex b/main.tex
index 9e79737..17c8760 100644
--- a/main.tex
+++ b/main.tex
@@ -87,10 +87,10 @@ The optimal cut $C^*$ for Connectivity Interdiction is a 2-approximation of glob
 \begin{frame}{Algorithm}
 \begin{algo}
 \underline{\textsc{FPTAS for Connectivity Interdiction}}$(G,w,c,b)$\\
-1. estimate Normalized Mincut\\
-2. enumerate all 2-approximate mincut with weight $w_\tau$\\
-3. \quad for each cut $C$ solve a knapsack to compute $F$\\
-return $(C,F)$ with smallest objective value.
+1. estimate Normalized Mincut $\tau$\\
+2. \quad enumerate all 2-approximate mincut with weight $w_\tau$\\
+3. \quad \quad for each cut $C$ solve a knapsack to compute $F$\\
+4. return $(C,F)$ with smallest objective value.
 \end{algo}
 
 1 takes $O(\log_{1+\epsilon}(poly(n)))$ time;\newline