関連したドキュメント
Max-flow min-cut theorem and faster algorithms in a circular disk failure model, INFOCOM 2014...
Hungarian Method Kuhn (1955) based on works of K ő nig and
of IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS 2010), pp..
情報理工学研究科 情報・通信工学専攻. 2012/7/12
最大消滅部分空間問題 MVSP Maximum Vanishing Subspace Problem.. MVSP:
参考文献 Niv Buchbinder and Joseph (Seffi) Naor: The Design of Com- petitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends® in Theoretical Computer
"A matroid generalization of the stable matching polytope." International Conference on Integer Programming and Combinatorial Optimization (IPCO 2001). "An extension of
Murota: Discrete Convex Analysis (SIAM Monographs on Dis- crete Mathematics and Applications 10, SIAM,