Abstract
The generalized maximum linear arrangement problem is to compute for a given vector x ∈ ℝn and an n x n non-negative symmetric matrix w = (w i,j), a permutation ? of 1,...,n that maximizes σi,j w π i,π j |xj- xi|. We present a fast 1/3-approximation algorithm for the problem. We also introduce a 12-approximation algorithm for max k-cut with given sizes. This matches the bound obtained by Ageev and Sviridenko, but without using linear programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. A. Ageev, personal communication.
A. A. Ageev, R. Hassin, and M. I. Sviridenko, “Directed max cut with given sizes of parts”, 1999.
A. A. Ageev and M. I. Sviridenko, “Approximation algorithms for maximum coverage and max cut with given sizes of parts”, IPCO’ 99.
E. Arkin, R. Hassin and M. I. Sviridenko, “Approximating the maximum quadratic assignment problem”. A preliminary version appeared in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2000), 889–890.
R. Bar-Yehuda, “Using homogeneous weights for approximating the partial cover problem”, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA99), 71–75, 1999.
J-C. Picard and H. D. Ratliff, “A cut approach to the rectilinear distance facility location problem”, Operations Research 26, 1978, 422–433.
A. Tamir, “Obnoxious facility location on graphs,” SIAM J. Discrete Mathematics 4, 1991, 550–567.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassin, R., Rubinstein, S. (2000). Approximation Algorithms for Maximum Linear Arrangement. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive