Lower bounds for the relative greedy algorithm for approximating Steiner trees