Smoothed analysis of belief propagation for minimum-cost flow and matching

被引：3
|
作者：
机构：
[1] Brunsch, Tobias
[2] Cornelissen, Kamiel
[3] Manthey, Bodo
[4] Röglin, Heiko
来源：
| 1600年 / Brown University卷 / 17期
关键词：
Compendex;
D O I：
10.7155/jgaa.00310
中图分类号：
学科分类号：
摘要：
Belief propagation
引用
收藏
相关论文
共 50 条
  • [1] Coupled Minimum-Cost Flow Cell Tracking
    Padfield, Dirk
    Rittscher, Jens
    Roysam, Badrinath
    [J]. INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS, 2009, 5636 : 374 - +
  • [2] Minimum-cost flow algorithms: an experimental evaluation
    Kovacs, Peter
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2015, 30 (01): : 94 - 127
  • [3] MINIMUM-COST ANALYSIS OF STATION CONFIGURATIONS
    SATISH, J
    BILLINTON, R
    [J]. IEEE TRANSACTIONS ON POWER DELIVERY, 1995, 10 (04) : 1799 - 1805
  • [4] Generalized Preconditioning and Undirected Minimum-Cost Flow
    Sherman, Jonah
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 772 - 780
  • [5] EFFICIENT MINIMUM-COST MATCHING AND TRANSPORTATION USING THE QUADRANGLE INEQUALITY
    AGGARWAL, A
    BARNOY, A
    KHULLER, S
    KRAVETS, D
    SCHIEBER, B
    [J]. JOURNAL OF ALGORITHMS, 1995, 19 (01) : 116 - 143
  • [6] An efficient implementation of a scaling minimum-cost flow algorithm
    Goldberg, AV
    [J]. JOURNAL OF ALGORITHMS, 1997, 22 (01) : 1 - 29
  • [7] MINIMUM-COST CHOKES
    ODDIE, TH
    SALPETER, JL
    [J]. PHILIPS RESEARCH REPORTS, 1947, 2 (04): : 281 - 312
  • [8] PARALLEL ALGORITHMS FOR THE ASSIGNMENT AND MINIMUM-COST FLOW PROBLEMS
    ORLIN, JB
    STEIN, C
    [J]. OPERATIONS RESEARCH LETTERS, 1993, 14 (04) : 181 - 186
  • [9] MINIMUM-COST DISTANCES IN SPATIAL-ANALYSIS
    HURIOT, JM
    SMITH, TE
    THISSE, JF
    [J]. GEOGRAPHICAL ANALYSIS, 1989, 21 (04) : 294 - 315
  • [10] The biobjective minimum-cost perfect matching problem and Chinese postman problem
    Pozo, Miguel A.
    Puerto, Justo
    Roldan, Ignacio
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (05) : 2988 - 3009
12345