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 条
  • [21] A deterministic multidimensional scaling algorithm for data visualisation
    Don, Anthony
    Hanusse, Nicolas
    INFORMATION VISUALIZATION-BOOK, 2006, : 511 - +
  • [22] DETERMINISTIC POLYNOMIAL TIME ALGORITHMS FOR MATRIX COMPLETION PROBLEMS
    Ivanyos, Gabor
    Karpinski, Marek
    Saxena, Nitin
    SIAM JOURNAL ON COMPUTING, 2010, 39 (08) : 3736 - 3751
  • [23] AN ALGORITHM FOR THE MINIMAL POLYNOMIAL OF A MATRIX
    GELBAUM, BR
    AMERICAN MATHEMATICAL MONTHLY, 1983, 90 (01): : 43 - 44
  • [24] A Strongly Polynomial Algorithm for Generalized Flow Maximization
    Vegh, Laszlo A.
    MATHEMATICS OF OPERATIONS RESEARCH, 2017, 42 (01) : 179 - 211
  • [25] A strongly polynomial algorithm for generalized flow maximization
    Vegh, Laszlo A.
    STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 644 - 653
  • [26] A STRONGLY POLYNOMIAL MINIMUM COST CIRCULATION ALGORITHM
    TARDOS, E
    COMBINATORICA, 1985, 5 (03) : 247 - 255
  • [27] STRONGLY POLYNOMIAL ALGORITHM FOR A CLASS OF COMBINATORIAL LCPS
    CHANDRASEKARAN, R
    KABADI, SN
    OPERATIONS RESEARCH LETTERS, 1987, 6 (02) : 91 - 92
  • [28] A Strongly Polynomial Algorithm for Linear Exchange Markets
    Garg, Jugal
    Vegh, Laszlo A.
    OPERATIONS RESEARCH, 2023, 71 (02) : 487 - 505
  • [29] Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid
    Fonlupt, Jean
    Skoda, Alexandre
    RESEARCH TRENDS IN COMBINATORIAL OPTIMIZATION, 2009, : 69 - 85
  • [30] A Strongly Polynomial Algorithm for Linear Exchange Markets
    Garg, Jugal
    Vegh, Laszlo A.
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 54 - 65
12345