Minimizing submodular functions over families of sets
暂无分享,去创建一个
[1] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[2] L. Lovász. Combinatorial problems and exercises , 1979 .
[3] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[4] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[5] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[6] Martin Grötschel,et al. Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.
[7] Martin Grötschel,et al. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” , 1984, Comb..
[8] Michele Conforti,et al. A construction for binary matroids , 1987, Discret. Math..
[9] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[10] 藤重 悟. Submodular functions and optimization , 1991 .
[11] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[12] H. Gabow. An E cient Approximation Algorithmfor the Survivable Network Design Problem , 1993 .
[13] David P. Williamson,et al. A primal-dual approximation algorithm for generalized steiner network problems , 1993, Comb..
[14] Toshihide Ibaraki,et al. Computing All Small Cuts in Undirected Networks , 1994, ISAAC.