# HG changeset patch
# User Markus Kaiser <markus.kaiser@in.tum.de>
# Date 1406652612 -7200
# Node ID db04ec64fe7b141ef24718410c6c5c6dad8852d3
# Parent  c02cfd41bcc49e948b25765a890d37ea3fefd804
repetition

diff -r c02cfd41bcc4 -r db04ec64fe7b minimum_bisection/paper/term_paper.tex
--- a/minimum_bisection/paper/term_paper.tex	Tue Jul 29 18:49:41 2014 +0200
+++ b/minimum_bisection/paper/term_paper.tex	Tue Jul 29 18:50:12 2014 +0200
@@ -246,7 +246,7 @@
     f_e &= \sum_{i} \lambda_i \sum_{\substack{\alert{e_T} \in T_i:\\\structure{e} \in P_i(\alert{e_T})}} D_i(\alert{e_T}).
 \end{align}
 
-If we again suppose to find a set of path trees such that
+Suppose we find a set of path trees such that
 \begin{align}
     \forall \structure{e} \in E.\quad c_{e} &\geq \frac{1}{\alpha} \sum_{i} \lambda_i \sum_{\substack{\alert{e_T} \in T_i:\\\structure{e} \in P_i(\alert{e_T})}} C_i(\alert{e_T})
     \intertext{we can again bound its congestion by the optimal solution using \cref{lem:optimal}.}