Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
2014 (English)In: ACM Transactions on Algorithms, ISSN 1549-6325, E-ISSN 1549-6333, Vol. 10, no 4, 18- p.Article in journal (Refereed) Published
We show that for every positive epsilon > 0, unless NP subset of BP QP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than 2log(1-epsilon)n by a reduction from the maximum label cover problem. Our result also implies that Approximate Graph Isomorphism is not robust and is, in fact, 1 - epsilon versus epsilon hard assuming the Unique Games Conjecture. Then, we present an O(root n)-approximation algorithm for the problem based on rounding of the linear programming relaxation often used in state-of-the-art exact algorithms.
Place, publisher, year, edition, pages
2014. Vol. 10, no 4, 18- p.
Algorithms, Theory, Inapproximability, quadratic assignment problem
Computer Science Mathematics
IdentifiersURN: urn:nbn:se:kth:diva-156462DOI: 10.1145/2629672ISI: 000343962200002ScopusID: 2-s2.0-84906852643OAI: oai:DiVA.org:kth-156462DiVA: diva2:767370
QC 201412012014-12-012014-11-282014-12-01Bibliographically approved