Before revision:  Finally, generalizing the technique of }[ \tilde{O}) in }\tilde{O} .
After revision:  Finally, generalizing the technique of }[ for unweighted graphs, we devise an efficient randomized algorithm producing a +2W spanner for weighted graphs of size\tilde{O}) in }\tilde{O} .