Sensor selection from independence graphs using submodularity
暂无分享,去创建一个
[1] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[2] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[3] H. B. McMahan,et al. Robust Submodular Observation Selection , 2008 .
[4] 藤重 悟. Submodular functions and optimization , 1991 .
[5] Thomas Powers,et al. Sensor management for multistatics , 2014, 17th International Conference on Information Fusion (FUSION).
[6] Andreas Krause,et al. SFO: A Toolbox for Submodular Function Optimization , 2010, J. Mach. Learn. Res..
[7] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[8] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[9] Stephen P. Boyd,et al. Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.
[10] Ian F. Akyildiz,et al. Sensor Networks , 2002, Encyclopedia of GIS.
[11] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[12] Rishabh K. Iyer,et al. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.
[13] Kenji Kashiwabara,et al. Matroid Representation of Clique Complexes , 2003, COCOON.
[14] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..