Can hospitals afford digital storage for imagery?
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
We consider the well-known minimum quadratic assignment problem. In this problem we are given two n × n nonnegative symmetric matrices A = (a ij) 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. © 2009 ACM.
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
A. Skumanich
SPIE OE/LASE 1992
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems