From 96f5a11aec4e9a6c94eedc3167ac42b4f62c6f93 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Thu, 5 Mar 2015 12:51:43 -0500
Subject: Revert "ArXiv version"

This reverts commit 26e0b3c4128c6d8c215ee894b1f447f1984d55f0.
---
 paper/sections/adaptivity.tex | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

(limited to 'paper/sections/adaptivity.tex')

diff --git a/paper/sections/adaptivity.tex b/paper/sections/adaptivity.tex
index 8e2e52f..d590408 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 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.
+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.
 
 \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 Appendix~\ref{sec:ad-proofs}.
+be found in the full version of this paper~\cite{full}.
 \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
-- 
cgit v1.2.3-70-g09d2

