The following publications are possibly variants of this publication:
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation AlgorithmKonstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko. TALG, 10(4):18, 2014. [doi]
- On the maximum quadratic assignment problemViswanath Nagarajan, Maxim Sviridenko. soda 2009: 516-524 [doi]
- On the Maximum Quadratic Assignment ProblemViswanath Nagarajan, Maxim Sviridenko. mor, 34(4):859-868, 2009. [doi]
- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover ProblemsMarkus Bläser, L. Shankar Ram, Maxim Sviridenko. wads 2005: 350-359 [doi]
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problemsMarkus Bläser, L. Shankar Ram, Maxim Sviridenko. orl, 37(3):176-180, 2009. [doi]
- Tight approximation algorithms for maximum general assignment problemsLisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko. soda 2006: 611-620 [doi]
- Tight Approximation Algorithms for Maximum Separable Assignment ProblemsLisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko. mor, 36(3):416-431, 2011. [doi]
- Approximating the maximum quadratic assignment problemEsther M. Arkin, Refael Hassin, Maxim Sviridenko. ipl, 77(1):13-16, 2001. [doi]