An improved approximation ratio for the minimum linear arrangement problem

Information Processing Letters

Volumn 101, Issue 1, 2007, Pages 26-29

  Feige, Uriel ^a,b   Lee, James R ^c  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Approximation algorithms

Indexed keywords

ALGORITHMS; DATA PROCESSING; LINEAR PROGRAMMING; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; APPROXIMATION RATIO; LINEAR ARRANGEMENT PROBLEM;

APPROXIMATION THEORY;

EID: 33750380218     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.07.009     Document Type: Article

References (8)

1. Arora S., Lee J.R., and Naor A. Euclidean distortion and the Sparsest Cut. 37th Annual Symposium on the Theory of Computing (2005) 553-562. http://www.cs.berkeley.edu/~jrl Full version available at
2. S. Arora, S. Rao, U. Vazirani, Expander flows, geometric embeddings, and graph partitionings, in: 36th Annual Symposium on the Theory of Computing, 2004, pp. 222-231
3. 2 spreading metrics for vertex ordering problems, in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
4. S. Chawla, A. Gupta, H. Räcke, Embeddings of negative-type metrics and an improved approximation to generalized Sparsest Cut, in: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 102-111
5. Even G., Naor J., Rao S., and Schieber B. Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47 4 (2000) 585-616
6. P.N. Klein, S.A. Plotkin, S. Rao, Excluded minors, network decomposition, and multicommodity flow, in: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 682-690
7. J.R. Lee, On distance scales, embeddings, and efficient relaxations of the cut cone, in: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 92-101
8. Rao S., and Richa A.W. New approximation techniques for some linear ordering problems. SIAM J. Comput. 34 2 (2004) 388-404