Approximating the maximum quadratic assignment problem

Information Processing Letters

Volumn 77, Issue 1, 2001, Pages 13-16

  Arkin, Esther M ^a   Hassin, Refael ^b   Sviridenko, Maxim ^c  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

ALGORITHMICAL APPROXIMATION; QUADRATIC ASSIGNMENT PROBLEMS;

QUADRATIC PROGRAMMING;

EID: 0035151924     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00151-4     Document Type: Article

References (23)

1. Ageev A.A., Sviridenko M.I. Approximation algorithms for maximum coverage and max cut with given sizes of parts. Proceedings of IPCO'99. Lecture Notes in Comput. Sci. Vol. 1610:1999;17-30 Springer, Berlin.
2. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice-Hall, Englewood Cliffs, NJ.
3. Alon N., Spencer J.H. The Probabilistic Method. 1992;John Wiley and Sons, New York.
4. Chalasani P., Motwani R. Approximating capacitated routing and delivery problems. SIAM J. Comput. Vol. 28:1999;2133-2149.
5. U. Feige, G. Kortsarz, D. Peleg, The dense k -subgraph problem, Algorithmica, to appear.
6. Feige U., Langberg M. Approximation algorithms for maximization problems arising in graph partitioning. Manuscript:1999.
7. Feo T., Khellaf M. A class of bounded approximation algorithms for graph partitioning. Networks. Vol. 20:1990;181-195.
8. Frieze A., Jerrum M. Improved approximation algorithms for MAX k -CUT and MAX BISECTION. Algorithmica. Vol. 18:1997;67-81.
9. Goemans M.X., Williamson D.P. A general approximation technique for constrained forest problems. SIAM J. Comput. Vol. 24:1995;296-317.
10. Guttmann-Beck N., Hassin R. Approximation algorithms for minimum tree partition. Discrete Appl. Math. Vol. 87:1998;117-137.
11. Guttmann-Beck N., Hassin R. Approximation algorithms for min-sum p -clustering. Discrete Appl. Math. Vol. 89:1998;125-142.
12. Hassin R., Rubinstein S. An approximation algorithm for maximum packing of 3-edge paths. Inform. Process. Lett. Vol. 63:1997;63-67.
13. R. Hassin, S. Rubinstein, Robust matchings, maximum clustering, and maximum capacitated medians, submitted for publication. Extended abstract appeared in: M. Halldórsson (Ed.), Algorithm Theory - SWAT2000, Lecture Notes in Comput. Sci., Vol. 1851, pp. 251-258.
14. Hassin R., Rubinstein S. Better approximations for max TSP. Inform. Process. Lett. Vol. 75:2000;181-186.
15. Hassin R., Rubinstein S. Approximation algorithms for maximum linear arrangement. 1999;. Extended abstract appeared in: M. Halldórsson (Ed.), Algorithm Theory - SWAT2000, Lecture Notes in Comput. Sci., Vol. 1851, pp. 231-236.
16. Hassin R., Rubinstein S., Tamir A. Approximation algorithms for maximum dispersion. Oper. Res. Lett. Vol. 21:1997;133-137.
17. Kostochka A.V., Serdyukov A.I. Polynomial algorithms with the estimates 3 4 and 5 6 for the traveling salesman problem of the maximum. Upravlyaemye Sistemy. Vol. 26:1985;55-59. (in Russian).
18. Papadimitriou C.H., Yannakakis M. The traveling salesman problem with distances one and two. Math. Oper. Res. Vol. 18:1993;1-11.
19. Queyranne M. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Oper. Res. Lett. Vol. 4:1986;231-234.
20. Ravi S.S., Rosenkrantz D.J., Tayi G.K. Heuristic and special case algorithms for dispersion problems. Oper. Res. Vol. 42:1994;299-310.
21. Serdyukov A.I. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy. Vol. 2:(5):1984;80-86. (in Russian).
22. Sahni S., Gonzalez T. P-complete approximation problems. J. ACM. Vol. 23:1976;555-565.
23. Tamir A. Obnoxious facility location on graphs. SIAM J. Discrete Math. Vol. 4:1991;550-567.