Before revision:    For the directed Steiner forest problem with uniform costs, in which the pairs of vertices to be connected arrive online, we present an efficient randomized O(n^{2/3 + \epsilon})-competitive algorithm.
After revision:  (n^{3/5 + \epsilon For the directed Steiner forest problem with uniform costs, in which the pairs of vertices to be connected arrive online, we present an efficient randomized O(n^{2/3 + \epsilon})-competitive algorithm.