Robust Sensor Placement for Detecting Adversarial Contaminations in Water Distribution Systems
暂无分享,去创建一个
[1] Lewis A. Rossman,et al. The EPANET Programmer's Toolkit for Analysis of Water Distribution Systems , 1999 .
[2] Avi Ostfeld,et al. The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .
[3] Sudipto Guha,et al. Asymmetric k-center is log* n-hard to approximate , 2005, JACM.
[4] Harvey J. Greenberg,et al. Digital Object Identifier (DOI) 10.1007/s10107-005-0689-x , 2005 .
[5] Pierre Hansen,et al. Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search , 2000, Networks.
[6] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[7] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..
[8] William E. Hart,et al. FORMULATION AND OPTIMIZATION OF ROBUST SENSOR PLACEMENT PROBLEMS FOR CONTAMINANT WARNING SYSTEMS , 2008 .
[9] Rina Panigrahy,et al. An O(log*n) approximation algorithm for the asymmetric p-center problem , 1996, SODA '96.
[10] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[11] H. B. McMahan,et al. Robust Submodular Observation Selection , 2008 .
[12] E. Minieka. The m-Center Problem , 1970 .
[13] Barbara M. Anthony,et al. A plant location guide for the unsure , 2008, SODA '08.