Approximation algorithms for maximum linear arrangement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 231-236

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING;

LINEAR ARRANGEMENTS; NON NEGATIVES; SYMMETRIC MATRICES;

APPROXIMATION ALGORITHMS;

EID: 84956863978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (7)

1. A. A. Ageev, personal communication.
2. A. A. Ageev, R. Hassin, and M. I. Sviridenko, “Directed max cut with given sizes of parts", 1999.
3. A. A. Ageev and M. I. Sviridenko, “Approximation algorithms for maximum coverage and max cut with given sizes of parts", IPCO'99.
4. E. Arkin, R. Hassin and M. I. Sviridenko, “Approximating the maximum quadratic assignment problem". A preliminary version appeared in Proceed-ings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2000), 889-890.
5. 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.
6. J-C. Picard and H. D. Ratliff, “A cut approach to the rectilinear distance facility location problem", Operations Research 26, 1978, 422-433.
7. A. Tamir, “Obnoxious facility location on graphs," SIAM J. Discrete Mathe-matics 4, 1991, 550-567.