An improved approximation ratio for the minimum linear arrangement problem

We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an -approximation for the minimum-linear arrangement problem. This improves over the O(logn)-approximation of Rao and Richa.