Before revision:  However, for higher reservation costs between \sqrt{2}-1 and 0.5 , an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible.
After revision:  However, for higher reservation costs between \sqrt{2}-1 , an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible.