Heuristics with constant error guarantees for the design of tree networks
Management Science
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for minimum tree partition
Discrete Applied Mathematics
Approximation algorithms for min-sum p-clustering
Discrete Applied Mathematics
P-Complete Approximation Problems
Journal of the ACM (JACM)
On the Maximum Scatter Traveling Salesperson Problem
SIAM Journal on Computing
Approximating the maximum quadratic assignment problem
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved approximation ratio for the minimum linear arrangement problem
Information Processing Letters
On the maximum quadratic assignment problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Maximizing polynomials subject to assignment constraints
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Dynamic programming for the quadratic assignment problem on trees
Automation and Remote Control
NetDEO: automating network design, evolution, and optimization
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Embedding paths into trees: VM placement to minimize congestion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We consider the well-known minimum quadratic assignment problem. In this problem we are given two n × n nonnegative symmetric matrices A = (aij) and B = (bij). The objective is to compute a permutation π of V = {1,…,n} so that ∑ i,j∈Vi≠j aπ(i),π(j)bi,j is minimized. We assume that A is a 0/1 incidence matrix of a graph, and that B satisfies the triangle inequality. We analyze the approximability of this class of problems by providing polynomial bounded approximations for some special cases, and inapproximability results for other cases.