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:  In the offline setting, the current best approximation ratio with uniform lengths is 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.