From fca9d9fca8141e104b792ce0b27346d83af71b82 Mon Sep 17 00:00:00 2001 From: Stratis Ioannidis Date: Mon, 11 Feb 2013 19:29:32 -0800 Subject: small changes --- proofs.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'proofs.tex') 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 -- cgit v1.2.3-70-g09d2