A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents

We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop the first strongly polynomial-time algorithm for matrix scaling an important nonlinear optimization problem with many applications. Our work suggests a simple new (slow) polynomial time decision algorithm for bipartite perfect matching, conceptually different from classical approaches. ∗Hebrew University. Work supported in part by a grant of the Binational Israel-US Science Foundation. †Hebrew University ‡Hebrew University. Work partially supported by grant 032-7736 from the Israel Academy of Sciences. Part of this work was done during a visit to the Institute for Advanced Study, under the support of a Sloan Foundation grant 96-6-2.

[1]  T. Raghavan,et al.  On pairs of multidimensional matrices , 1984 .

[2]  Richard Sinkhorn.  A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[3]  S. Friedland,et al.  Additive decomposition of nonnegative matrices with applications to permanents and scalingt , 1988 .

[4]  B. Parlett,et al.  Methods for Scaling to Doubly Stochastic Form , 1982 .

[5]  A. Lent,et al.  Iterative reconstruction algorithms. , 1976, Computers in biology and medicine.

[6]  Carsten Lund,et al.  On the hardness of computing the permanent of random matrices , 1996, STOC '92.

[7]  J. Lorenz,et al.  On the scaling of multidimensional matrices , 1989 .

[8]  L. Gurvits,et al.  The Deeation-innation Method for Certain Semideenite Programming and Maximum Determinant Completion Problems , 1998 .

[9]  David T. Brown,et al.  A Note on Approximations to Discrete Probability Distributions , 1959, Inf. Control..

[10]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[11]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  P. W. Kasteleyn.  The Statistics of Dimers on a Lattice , 1961 .

[13]  H. Wilf.  On the Permanent of a Doubly Stochastic Matrix , 1966, Canadian Journal of Mathematics.

[14]  U. Rothblum,et al.  Scalings of matrices which have prespecified row sums and column sums via optimization , 1989 .

[15]  D. Falikman.  Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix , 1981 .

[16]  N. S. Barnett,et al.  Private communication , 1969 .

[17]  Eli Upfal,et al.  Are search and decision programs computationally equivalent? , 1985, STOC '85.

[18]  James Hardy Wilkinson,et al.  Rounding errors in algebraic processes , 1964, IFIP Congress.

[19]  Alexander Barvinok.  A simple polynomial time algorithm to approximate the permanent within a simply exponential factor , 1997 .

[20]  Ulrich Derigs,et al.  An analysis of alternative strategies for implementing matching algorithms , 1983, Networks.

[21]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[22]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[23]  G. Egorychev.  The solution of van der Waerden's problem for permanents , 1981 .

[24]  L. Khachiyan,et al.  ON THE COMPLEXITY OF NONNEGATIVE-MATRIX SCALING , 1996 .

[25]  Richard J. Lipton,et al.  A Monte-Carlo Algorithm for Estimating the Permanent , 1993, SIAM J. Comput..

[26]  Alexander I. Barvinok,et al.  Computing Mixed Discriminants, Mixed Volumes, and Permanents , 1997, Discret. Comput. Geom..

[27]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, International Symposium on Fundamentals of Computation Theory.

[28]  S. Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

[29]  Carsten Lund,et al.  On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) , 1992, STOC.