Deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

Abstract

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 (slow) decision algorithm for bipartite perfect matching, conceptually different from known approaches.