From 77da4af12b8b60677b2740a196fde17b74f67817 Mon Sep 17 00:00:00 2001
From: Yu Cong <sxlxcsxlxc@gmail.com>
Date: Tue, 6 Jan 2026 14:47:26 +0800
Subject: [PATCH] z

---
 main.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/main.tex b/main.tex
index 8b21833..232cf4e 100644
--- a/main.tex
+++ b/main.tex
@@ -217,7 +217,7 @@ Consider $L(\lambda)$ for cut problem. One can see that the optimal $\lambda$ is
 
 
 \subsection{integrality gap}
-I guess the 2-approximate min-cut enumeration algorithm implies an integrality gap of 2 for cut interdiction problem. \textcolor{red}{Which is wrong}.
+% I guess the 2-approximate min-cut enumeration algorithm implies an integrality gap of 2 for cut interdiction problem. \textcolor{red}{Which is wrong}.
 
 First consider the dual of linear relaxation of \autoref{ip:interdiction}.