Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
KTH, School of Computer Science and Communication (CSC).
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
Abstract [en]

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.
Keyword [en]
Algorithms, Theory, Inapproximability, quadratic assignment problem
National Category
Computer Science Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-156462DOI: 10.1145/2629672ISI: 000343962200002Scopus ID: 2-s2.0-84906852643OAI: oai:DiVA.org:kth-156462DiVA: diva2:767370
Note

QC 20141201

Available from: 2014-12-01 Created: 2014-11-28 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Manokaran, Rajsekar
By organisation
School of Computer Science and Communication (CSC)
In the same journal
ACM Transactions on Algorithms
Computer ScienceMathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf