TY - JOUR
T1 - Deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
AU - Linial, Nathan
AU - Samorodnitsky, Alex
AU - Wigderson, Avi
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0031619018&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0031619018
SN - 0734-9025
SP - 644
EP - 652
JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
T2 - Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing
Y2 - 23 May 1998 through 26 May 1998
ER -