An improved approximation ratio for the minimum linear arrangement problem

Authors:
Uriel Feige;James R. Lee
Affiliations:
Microsoft Research, Redmond, WA and Department of Computer Science and Applied Mathematics, Weizmann Institute, Rehovot, Israel;Department of Mathematics, Institute for Advanced Study, Princeton, NJ
Venue:
Information Processing Letters
Year:
2007

Citing 8
Cited 9

Excluded minors, network decomposition, and multicommodity flow

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Divide-and-conquer approximation algorithms via spreading metrics

Journal of the ACM (JACM)
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New Approximation Techniques for Some Linear Ordering Problems

SIAM Journal on Computing
Euclidean distortion and the sparsest cut

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
l22 spreading metrics for vertex ordering problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Partitioning graphs into balanced components

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Expander flows, geometric embeddings and graph partitioning

Journal of the ACM (JACM)
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
FPGA placement using space-filling curves: Theory meets practice

ACM Transactions on Embedded Computing Systems (TECS)
Approximating the minimum quadratic assignment problems

ACM Transactions on Algorithms (TALG)
The directed circular arrangement problem

ACM Transactions on Algorithms (TALG)
Decorous Lower Bounds for Minimum Linear Arrangement

INFORMS Journal on Computing
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

SIAM Journal on Computing
d-dimensional arrangement revisited

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We observe 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. This improves over the O(logn)-approximation of Rao and Richa.