Final version

1 files changed, 5 insertions, 5 deletions

diff --git a/paper/sections/adaptivity.tex b/paper/sections/adaptivity.tex
index d590408..8e2e52f 100644
--- a/paper/sections/adaptivity.tex
+++ b/paper/sections/adaptivity.tex
@@ -149,10 +149,10 @@ adaptive policy is upper bounded by the optimal non-adaptive policy:
 %    \end{displaymath}
 %\end{proposition}
 
-The proof of this proposition can be found in the full version of the
-paper~\cite{full} and relies on the following fact: the optimal adaptive policy
-can be written as a feasible non-adaptive policy, hence it provides a lower
-bound on the value of the optimal non-adaptive policy.
+The proof of this proposition can be found in Appendix~\ref{sec:ad-proofs} and
+relies on the following fact: the optimal adaptive policy can be written as
+a feasible non-adaptive policy, hence it provides a lower bound on the value of
+the optimal non-adaptive policy.
 
 \subsection{From Non-Adaptive to Adaptive Solutions}\label{sec:round}
 
@@ -212,7 +212,7 @@ $S$ that we denote by $A(S)$.
 
 More precisely, denoting by $\text{OPT}_A$ the optimal value of the adaptive
 problem~\eqref{eq:problem}, we have the following proposition whose proof can
-be found in the full version of this paper~\cite{full}.
+be found in Appendix~\ref{sec:ad-proofs}.
 \begin{proposition}\label{prop:cr}
     Let $(S,\textbf{q})$ be an $\alpha$-approximate solution to the
     non-adaptive problem \eqref{eq:relaxed}, then $\mathrm{A}(S) \geq \alpha