matrix to within a multiplicative factor of . 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 15, 1998
Rights and permissions
About this article
Cite this article
Linial, N., Samorodnitsky, A. & Wigderson, A. A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Combinatorica 20, 545–568 (2000). https://doi.org/10.1007/s004930070007
Issue Date:
DOI: https://doi.org/10.1007/s004930070007