Improved algorithms for submodular function minimization and submodular flow
暂无分享,去创建一个
[1] S. Fujishige,et al. New algorithms for the intersection problem of submodular systems , 1992 .
[2] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[3] Maurice Queyranne,et al. Minimizing symmetric submodular functions , 1998, Math. Program..
[4] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[5] Satoru Iwata,et al. A faster capacity scaling algorithm for minimum cost submodular flow , 2002, Math. Program..
[6] William H. Cunningham,et al. Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.
[7] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.
[8] András Frank,et al. Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.
[9] Satoru Iwata,et al. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.
[10] Tibor Jordán. Edge-Splitting Problems with Demands , 1999, IPCO.
[11] William H. Cunningham. On submodular function minimization , 1985, Comb..
[12] A. Frank,et al. An application of submodular flows , 1989 .
[13] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[14] Satoru Iwata,et al. A fast cost scaling algorithm for submodular flow , 2000, Inf. Process. Lett..
[15] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[16] Satoru Fujishige,et al. A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems , 1989, Math. Oper. Res..