Before revision:  This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] in two ways: it is deterministic and the logarithmic factor depends only on the maximum degree \Delta, not the number of vertices n .
After revision:  This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] by making it a deterministic algorithm .