Mercurial > latex

changeset 154:db04ec64fe7b

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
repetition
author Markus Kaiser <markus.kaiser@in.tum.de>
date Tue, 29 Jul 2014 18:50:12 +0200
parents c02cfd41bcc4
children b7fd203d37d8
files minimum_bisection/paper/term_paper.tex
diffstat 1 files changed, 1 insertions(+), 1 deletions(-) [+]
line wrap: on
line diff
--- 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}.}