Before revision:  (III) We obtain lower bounds of 4 and 5 for the } competitive ratio of an optimal deterministic online algorithm for OUC is at least 2.5 and at most^2 and respectively \mathbb{R}^3;
After revision:  (III) We obtain lower bounds of 4 and 5 for the } competitive ratio of any deterministic algorithm for online Unit Covering in \mathbb{R^2 and respectively \mathbb{R}^3;