summaryrefslogtreecommitdiffstats
path: root/main.tex
diff options
context:
space:
mode:
authorStratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>2012-11-04 19:59:20 -0800
committerStratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>2012-11-04 19:59:20 -0800
commit35ff12aed97bcae04e89853fefa7443a03875bec (patch)
tree3ea4dded79000d1b32cbb6eb42aaddf9c1102206 /main.tex
parentc8865535a14a79581d3b9eb7c52cb853a831e180 (diff)
downloadrecommendation-35ff12aed97bcae04e89853fefa7443a03875bec.tar.gz
small stuff
Diffstat (limited to 'main.tex')
-rw-r--r--main.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/main.tex b/main.tex
index f44d1c8..d3ba277 100644
--- a/main.tex
+++ b/main.tex
@@ -31,7 +31,7 @@ Let $S_G$ be the set computed by the greedy algorithm and define $i^*$:
\end{displaymath}
then the following inequality holds:
\begin{displaymath}
-OPT(V,\mathcal{N},B) \leq \frac{e}{e-1}\big( 3 V(S_G) + 2 V(i^*)\big)
+OPT(V,\mathcal{N},B) \leq \frac{e}{e-1}\big( 3 V(S_G) + 2 V(i^*)\big).
\end{displaymath}
\end{lemma}