Advertisement

Combinatorica

, Volume 20, Issue 4, pp 545–568 | Cite as

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents

  • Nathan Linial
  • Alex Samorodnitsky
  • Avi Wigderson
Original Paper

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.

AMS Subject Classification (1991) Classes:  90C27, 15A15, 15A12, 90C30, 65B99 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© János Bolyai Mathematical Society, 2000

Authors and Affiliations

  • Nathan Linial
    • 1
  • Alex Samorodnitsky
    • 2
  • Avi Wigderson
    • 3
  1. 1.School of Computer Science and Engeneering, The Hebrew University; Jerusalem 91904, Israel; E-mail: nati@cs.huji.ac.ilIL
  2. 2.School of Mathematics, Institute for Advanced Study; Princeton, NJ 08540, U.S.A.; E-mail: asamor@ias.eduUS
  3. 3.School of Mathematics, Institute for Advanced Study; Princeton, NJ 08540, U.S.A.; and School of Computer Science and Engineering; The Hebrew University; Jerusalem, 91904, Israel; E-mail: avi@ias.eduUS

Personalised recommendations