Skip to main content
Log in

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received October 15, 1998

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930070007

Navigation