article
An improved approximation ratio for the minimum linear arrangement problem
Uriel Feigea b, James R. Leec✉
- aDepartment of Computer Science and Applied Mathematics, Weizmann Institute, Rehovot, Israel
- bMicrosoft Research, Redmond, WA, USA
- cDepartment of Mathematics, Institute for Advanced Study, Princeton, NJ, USA
- ✉Corresponding author
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRIt is observed that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O(√logn log logn)-approximation for the minimum-linear arrangement problem. (Semantic Scholar)