Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
From MaRDI portal
Publication:3587410
DOI10.1007/978-3-642-14165-2_50zbMath1288.68273arXiv1403.7721MaRDI QIDQ3587410
M. I. Sviridenko, Konstantin Makarychev, Rajsekar Manokaran
Publication date: 7 September 2010
Published in: ACM Transactions on Algorithms, Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7721
90C35: Programming involving graphs or networks
90B80: Discrete location and assignment
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
