Before revision:  This provides the first known online, local, competitive routing algorithm with constant routing ratio for the Theta-4-graph , as well as improving the best known upper bound on the spanning ratio of these graphs from 237 to 17.  \approx 17.03.}
After revision:  This provides the first known online, local, competitive routing algorithm with constant routing ratio for the \Theta_4-graph , as well as improving the best known upper bound on the spanning ratio of these graphs from 237 to 17. \approx 17.03.}