Isotropic treatment of EMF effects in advanced photomasks
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
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.
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007