Simultaneous Parametric Maximum Flow Algorithm with Vertex Balancing
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[2] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[3] Dennis G. Severance,et al. Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.
[4] John W. Mamer,et al. Optimizing Field Repair Kits Based on Job Completion Rate , 1982 .
[5] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[6] Robert E. Tarjan,et al. A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..
[7] Robert E. Tarjan,et al. Improved Algorithms for Bipartite Network Flow , 1994, SIAM J. Comput..
[8] Andrew V. Goldberg,et al. On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.
[9] Bin Zhang,et al. A Simultaneous Parametric Maximum-Flow Algorithm for Finding the Complete Chain of Solutions , 2004 .
[10] Dorit S. Hochbaum. 50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today , 2004, Manag. Sci..
[11] Charles U. Martel,et al. A fast algorithm for the generalized parametric minimum cut problem and applications , 2005, Algorithmica.
[12] Éva Tardos,et al. A faster parametric minimum-cut algorithm , 1994, Algorithmica.
[13] Bin Zhang,et al. A Simultaneous Maximum Flow Algorithm for the Selection Model , 2005 .