暂无分享,去创建一个
[1] Carlos Guestrin,et al. A Note on the Budgeted Maximization of Submodular Functions , 2005 .
[2] Alan W. McMasters,et al. Optimal interdiction of a supply network , 1970 .
[3] W. C. Turner,et al. Optimal interdiction policy for a flow network , 1971 .
[4] Mel Krajden,et al. Modeling Control Strategies of Respiratory Pathogens , 2005, Emerging infectious diseases.
[5] R. Vohra,et al. Finding the most vital arcs in a network , 1989 .
[6] John N. Tsitsiklis,et al. Introduction to Probability , 2002 .
[7] Samir Khuller,et al. The complexity of finding most vital arcs and nodes , 1995 .
[8] Vladimir Gurvich,et al. Inapproximability Bounds for Shortest-Path Network Interdiction Problems , 2005 .
[9] H. W. Corley,et al. Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..
[10] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[11] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[12] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[13] David P. Morton,et al. A Stochastic Program for Interdicting Smuggled Nuclear Material , 2003 .
[14] Charles M. Grinstead,et al. Introduction to probability , 1999, Statistics for the Behavioural Sciences.
[15] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[16] J. S. Kong,et al. Wireless Ad Hoc Networks with Tunable Topology , 2007 .
[17] Jonathan David Farley,et al. Breaking Al Qaeda Cells: A Mathematical Analysis of Counterterrorism Operations (A Guide for Risk Assessment and Decision Making) , 2003 .