summaryrefslogtreecommitdiffstats
path: root/proofs.tex
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2013-02-11 19:04:25 -0800
committerThibaut Horel <thibaut.horel@gmail.com>2013-02-11 19:04:25 -0800
commitfcb7ef2df7ddd557ae689f79f32498dd2c705c01 (patch)
treec0cbfda9d1514d9d47786cbf2666c76eb11e37df /proofs.tex
parentc7b0c48affdf7bb19417a4016ba2a871792fbca6 (diff)
downloadrecommendation-fcb7ef2df7ddd557ae689f79f32498dd2c705c01.tar.gz
Fixing broken reference caused by previous commit
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 9358a3d..0b35805 100644
--- a/proofs.tex
+++ b/proofs.tex
@@ -46,7 +46,7 @@ We also use the following lemma from \cite{chen} which bounds $OPT$ in terms of
the value of $S_G$, as computed in Algorithm \ref{mechanism}, and $i^*$, the
element of maximum value.
-\begin{lemma}[\cite{chen}]
+\begin{lemma}[\cite{chen}]\label{lemma:greedy-bound}
Let $S_G$ be the set computed in Algorithm \ref{mechanism} and let
$i^*=\argmax_{i\in\mathcal{N}} V(\{i\})$. We have:
\begin{displaymath}