diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2013-02-11 19:04:25 -0800 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2013-02-11 19:04:25 -0800 |
| commit | fcb7ef2df7ddd557ae689f79f32498dd2c705c01 (patch) | |
| tree | c0cbfda9d1514d9d47786cbf2666c76eb11e37df | |
| parent | c7b0c48affdf7bb19417a4016ba2a871792fbca6 (diff) | |
| download | recommendation-fcb7ef2df7ddd557ae689f79f32498dd2c705c01.tar.gz | |
Fixing broken reference caused by previous commit
| -rw-r--r-- | proofs.tex | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -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} |
