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}