A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

被引：76

作者：

Linial, N ^{[1
]}

Samorodnitsky, A

Wigderson, A

机构：

[1] Hebrew Univ Jerusalem, Sch Engn & Comp Sci, IL-91904 Jerusalem, Israel

[2] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA

[3] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA

来源：

COMBINATORICA | 2000年 / 20卷 / 04期

关键词：

D O I：

10.1007/s004930070007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We present a deterministic strongly polynomial algorithm that computes the permanent of a, nonnegative nxn matrix to within a multiplicative factor of e(n). 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.

引用

页码：545 / 568

页数：24

共 50 条

[41] New strongly polynomial dual network simplex algorithm
Armstrong, Ronald D.
Jin, Zhiying
Mathematical Programming, Series B, 1997, 78 (02): : 131 - 148
[42] A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM
ORLIN, JB
OPERATIONS RESEARCH, 1993, 41 (02) : 338 - 350
[43] Strongly polynomial algorithm for a class of linear programming problems
Zhongshan Daxue Xuebao, 1 (06):
[44] An oracle strongly polynomial algorithm for bottleneck expansion problems
Zhang, JZ
Liu, ZH
OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (01): : 61 - 75
[45] A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming
Artmann, Stephan
Weismantel, Robert
Zenklusen, Rico
STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 1206 - 1219
[46] A COMPOSITE POLYNOMIAL ZEROFINDING MATRIX ALGORITHM
MALEK, F
VAILLANCOURT, R
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1995, 30 (02) : 37 - 47
[47] Composite polynomial zerofinding matrix algorithm
Comput Math Appl, 2 (37):
[48] An algorithm for polynomial matrix factor extraction
Henrion, D
Sebek, M
INTERNATIONAL JOURNAL OF CONTROL, 2000, 73 (08) : 686 - 695
[49] A strongly polynomial algorithm for the minimum cost tension problem
Hadjiat, M
Maurras, JF
DISCRETE MATHEMATICS, 1997, 165 : 377 - 394
[50] Strongly polynomial simplex algorithm for bipartite vertex packing
Armstrong, RD
Jin, ZY
DISCRETE APPLIED MATHEMATICS, 1996, 64 (02) : 97 - 103

← 1 2 3 4 5 →