summaryrefslogtreecommitdiffstats
path: root/proofs.tex
diff options
context:
space:
mode:
authorStratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>2013-02-11 19:29:32 -0800
committerStratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>2013-02-11 19:29:32 -0800
commitfca9d9fca8141e104b792ce0b27346d83af71b82 (patch)
tree8d7969ccd5ce8f58d1ea6b10f21a569c00176853 /proofs.tex
parentfcb7ef2df7ddd557ae689f79f32498dd2c705c01 (diff)
downloadrecommendation-fca9d9fca8141e104b792ce0b27346d83af71b82.tar.gz
small changes
Diffstat (limited to 'proofs.tex')
-rw-r--r--proofs.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/proofs.tex b/proofs.tex
index 0b35805..0c06d67 100644
--- a/proofs.tex
+++ b/proofs.tex
@@ -54,7 +54,7 @@ OPT \leq \frac{e}{e-1}\big( 3 V(S_G) + 2 V(i^*)\big).
\end{displaymath}
\end{lemma}
-Using Lemma~\ref{lemma:relaxation} we can complete the proof of
+Using Lemmas~\ref{lemma:relaxation} and~\ref{lemma:greedy-bound} we can complete the proof of
Theorem~\ref{thm:main} by showing that, for any $\varepsilon > 0$, if
$OPT_{-i}'$, the optimal value of $L$ when $i^*$ is excluded from
$\mathcal{N}$, has been computed to a precision $\varepsilon$, then the set