sxlxc/edge_conn_interdiction
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

z
All checks were successful
build pdf / build (push) Successful in 4s
Details

Browse Source
This commit is contained in:
Yu Cong
2026-01-06 14:47:26 +08:00
parent 10e96af266
commit 77da4af12b
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
main.tex
View File

@@ -217,7 +217,7 @@ Consider $L(\lambda)$ for cut problem. One can see that the optimal $\lambda$ is
\subsection{integrality gap} \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}. First consider the dual of linear relaxation of \autoref{ip:interdiction}.