# HG changeset patch
# User Markus Kaiser <markus.kaiser@in.tum.de>
# Date 1401636564 -7200
# Node ID 586786c6529760c61626486c48090718e4c20c9e
# Parent  247f86a0ff6b796d13a3a913c1e9549899441810
remove minor errors

diff -r 247f86a0ff6b -r 586786c65297 minimum_bisection/preamble.tex
--- a/minimum_bisection/preamble.tex	Wed May 21 23:12:14 2014 +0200
+++ b/minimum_bisection/preamble.tex	Sun Jun 01 17:29:24 2014 +0200
@@ -18,7 +18,7 @@
 \usepackage{tabu}
 \usepackage{tikz}
 \usepackage{pgfplots}
-\pgfplotsset{compat=1.8}
+\pgfplotsset{compat=1.9}
 \usetikzlibrary{shapes}
 \usetikzlibrary{fit}
 
diff -r 247f86a0ff6b -r 586786c65297 minimum_bisection/presentation.tex
--- a/minimum_bisection/presentation.tex	Wed May 21 23:12:14 2014 +0200
+++ b/minimum_bisection/presentation.tex	Sun Jun 01 17:29:24 2014 +0200
@@ -114,10 +114,6 @@
     \begin{itemize}
         \item Choose any \structure{spanning tree $T$} of $G$
         \item Routing along its unique paths is a feasible solution
-        \item The flow is defined by the demands of the splits. For $e_T \in E_T$
-            \begin{align}
-                f(e_T) &= D(e_T)
-            \end{align}
     \end{itemize}
 
     \centering
@@ -874,7 +870,7 @@
         \item Define a new \structure{cost function $c_T$} using tree splits
     \end{itemize}
     \begin{align}
-        c_T(e_T) &= C(e_t) & c_T(\delta(S)) = \sum_{\substack{e_T \in E_T:\\e_T \in \delta(S)}} C(e_T)
+        c_T(e_T) &= C(e_T) & c_T(\delta(S)) = \sum_{\substack{e_T \in E_T:\\e_T \in \delta(S)}} C(e_T)
     \end{align}
 
     \vfill