暂无分享,去创建一个
[1] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[2] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[3] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[4] Andreas Krause,et al. Efficient Informative Sensing using Multiple Robots , 2014, J. Artif. Intell. Res..
[5] Laurence A. Wolsey,et al. An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..
[6] Andreas Krause,et al. Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization , 2010, COLT 2010.
[7] Andreas Krause,et al. Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2009, IEEE Transactions on Information Theory.
[8] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[9] Andreas S. Schulz,et al. Revisiting the Greedy Approach to Submodular Set Function Maximization , 2007 .
[10] Julián Mestre,et al. Greedy in Approximation Algorithms , 2006, ESA.
[11] Andreas Krause,et al. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization , 2010, J. Artif. Intell. Res..
[12] Andreas Krause,et al. Near-Optimal Bayesian Active Learning with Noisy Observations , 2010, NIPS.
[13] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..