Stanford CS 369P.zip
需积分: 19 12 浏览量
2020-02-24
10:18:06
上传
评论
收藏 2.97MB ZIP 举报
Stanford CS 369P.zip （18个子文件） 
Stanford CS 369P 
lec12 Iterated rounding the generalized assignment problem.pdf 186KB lec6 Weighted non-bipartite matching.pdf 162KB lec10 Matroid intersection.pdf 186KB lec18 The submodular allocation problem.pdf 183KB lec2 The bipartite matching polytope, Konig's theorem.pdf 215KB lec11 Matroid union.pdf 176KB lec3 Totally unimodular matrices.pdf 183KB lec19 Submodular maximization subject to a matroid constraint.pdf 182KB lec7 Spanning trees and matroids.pdf 172KB lec4 Non-bipartite matching, Tutte-Berge formula.pdf 182KB lec1 LP duality, optimization and separation.pdf 241KB lec13-14 Budget-additive allocation.pdf 239KB lec9 Rank, matroid duality, and the matroid polytope.pdf 195KB lec17 Continuous extensions of submodular functions.pdf 199KB lec5 The matching polytope.pdf 171KB lec16 Submodular functions.pdf 195KB lec8 The greedy algorithm for matroids.pdf 174KB lec15 Bounded-degree spanning trees.pdf 112KB资源评论
