A capacity scaling algorithm for convex cost submodular flows

被引：24
|
作者：
Iwata, S
机构：
[1] Res. Inst. for Mathematical Sciences, Kyoto University
来源：
MATHEMATICAL PROGRAMMING | 1997年 / 76卷 / 02期
关键词：
submodular flow; polynomial algorithm; convex optimization;
D O I：
10.1007/BF02614442
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities is available.
引用
收藏
页码：299 / 308
页数：10
相关论文
共 50 条
  • [31] Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
    Koufogiannakis, Christos
    Young, Neal E.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 634 - 652
  • [32] Submodular Cost Submodular Cover with an Approximate Oracle
    Crawford, Victoria G.
    Kuhnle, Alan
    Thai, My T.
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [33] Lattice polyhedra and submodular flows
    Satoru Fujishige
    Britta Peis
    Japan Journal of Industrial and Applied Mathematics, 2012, 29 : 441 - 451
  • [34] Generalized polymatroids and submodular flows
    Frank, Andras
    Tardos, Eva
    Mathematical Programming, Series B, 1988, 42 (01): : 489 - 563
  • [35] CENTROIDS, REPRESENTATIONS, AND SUBMODULAR FLOWS
    GABOW, HN
    JOURNAL OF ALGORITHMS, 1995, 18 (03) : 586 - 628
  • [36] Practical algorithm for minimum cost submodular cover problem with performance guarantees
    Pham, Canh V.
    Tran, Tan D.
    Ha, Dung T. K.
    Phu, Quat V.
    OPTIMIZATION LETTERS, 2025,
  • [37] Lattice polyhedra and submodular flows
    Fujishige, Satoru
    Peis, Britta
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2012, 29 (03) : 441 - 451
  • [38] GENERALIZED POLYMATROIDS AND SUBMODULAR FLOWS
    FRANK, A
    TARDOS, E
    MATHEMATICAL PROGRAMMING, 1988, 42 (03) : 489 - 563
  • [39] Fair integral submodular flows
    Frank, Andras
    Murota, Kazuo
    DISCRETE APPLIED MATHEMATICS, 2022, 320 : 416 - 434
  • [40] A strongly polynomial cut canceling algorithm for minimum cost submodular flow
    Iwata, S
    McCormick, ST
    Shigeno, M
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) : 304 - 320
12345