Maximum quadratic assignment problem: Reduction from maximum label cover and LP-based approximation algorithm

Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We show that for every positive ε > 0, unless NP ∪ BPQP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than 2log1?ε 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 ? ε versus ε hard assuming the Unique Games Conjecture. Then, we present an O(√n)- approximation algorithm for the problem based on rounding of the linear programming relaxation often used in state-of-the-art exact algorithms.

Original languageEnglish (US)
Article number18
JournalACM Transactions on Algorithms
Volume10
Issue number4
DOIs
StatePublished - Aug 2014

Keywords

  • Inapproximability
  • Quadratic assignment problem

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Fingerprint Dive into the research topics of 'Maximum quadratic assignment problem: Reduction from maximum label cover and LP-based approximation algorithm'. Together they form a unique fingerprint.

Cite this