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 O( √ log n log log n)-approximation for the minimum-linear arrangement problem. This improves over the O(log n)-approximation of Rao and Richa.

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Uriel Feige, James R. Lee
• Keywords: Arora, IPL 2007, Minimum-linear Arrangement Problem, Vazirani