| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428431 | Information Processing Letters | 2007 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
