暂无分享,去创建一个
[1] Vahab S. Mirrokni,et al. Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.
[2] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[3] Satoru Iwata,et al. Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[4] Seth Pettie,et al. An optimal minimum spanning tree algorithm , 2000, JACM.
[5] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[6] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[7] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[8] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[9] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[10] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[11] William J. Cook,et al. Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..
[12] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[13] Vahab S. Mirrokni,et al. Approximating submodular functions everywhere , 2009, SODA.
[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[15] U. Feige,et al. Maximizing Non-monotone Submodular Functions , 2011 .
[16] Gagan Goel,et al. Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[17] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.