New Query Lower Bounds for Submodular Function MInimization
暂无分享,去创建一个
[1] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[2] James B. Orlin,et al. A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..
[3] William H. Cunningham. On submodular function minimization , 1985, Comb..
[4] Satoru Iwata,et al. A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.
[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[6] Hui Lin,et al. Optimal Selection of Limited Vocabulary Speech Corpora , 2011, INTERSPEECH.
[7] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory, Ser. B.
[8] Maurice Queyranne,et al. Minimizing symmetric submodular functions , 1998, Math. Program..
[9] Satoru Iwata,et al. Submodular function minimization , 2007, Math. Program..
[10] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[11] Pushmeet Kohli,et al. Dynamic Graph Cuts and Their Applications in Computer Vision , 2010, Computer Vision: Detection, Recognition and Reconstruction.
[12] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[13] Satoru Iwata,et al. A simple combinatorial algorithm for submodular function minimization , 2009, SODA.
[14] Pushmeet Kohli,et al. P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[15] Jens Vygen,et al. A note on Schrijver's submodular function minimization algorithm , 2003, J. Comb. Theory, Ser. B.
[16] C. SIAMJ.. A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗ , 2001 .
[17] Yin Tat Lee,et al. A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[18] Yin Tat Lee,et al. Subquadratic submodular function minimization , 2016, STOC.
[19] S. Matthew Weinberg,et al. Computing Exact Minimum Cuts Without Knowing the Graph , 2017, ITCS.
[20] Nicholas J. A. Harvey. Matchings, matroids and submodular functions , 2008 .
[21] Satoru Iwata,et al. Improved algorithms for submodular function minimization and submodular flow , 2000, STOC '00.
[22] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .