An efficient curing policy for epidemics on graphs

IEEE Transactions on Network Science and Engineering

Volumn 1, Issue 2, 2014, Pages 67-75

  Drakopoulos, Kimon ^a   Ozdaglar, Asuman ^a   Tsitsiklis, John N ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Contagious diseases; Curing rates; Diseases; Epidemics; Graph theory; Networks; Process control; Resource management; Time measurement

Indexed keywords

BUDGET CONTROL; CURING; DISEASE CONTROL; DISEASES; GRAPH STRUCTURES; NETWORKS (CIRCUITS); PROCESS CONTROL; TIME MEASUREMENT;

BOUNDED DEGREE; CONSTANT FACTORS; CONTAGIOUS DISEASE; CURING RATES; DYNAMIC POLICY; EPIDEMICS; RESOURCE MANAGEMENT; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 84922700747     PISSN: None     EISSN: 23274697     Source Type: Journal    
DOI: 10.1109/TNSE.2015.2393291     Document Type: Article

References (17)

1. D. Bienstock and P. Seymour. (1991). Monotonicity in graph searching. J. Algorithms [Online]. 12(2), pp. 239-245. Available: http://www.sciencedirect.com/science/article/pii/019667749190003H
2. C. Borgs, J. Chayes, A. Ganesh, and A. Saberi. (2010). How to distribute antidote to control epidemics. Random Structures and Algorithms [Online]. 37(2), pp. 204-222. Available: http://dx.doi.org/10.1002/rsa.20315
3. F. R. K. Chung, P. Horn, and A. Tsiatas. (2009). Distributing antidote using pagerank vectors. Internet Math. [Online]. 6(2), pp. 237-254. Available: http://dblp.uni-trier.de/db/journals/im/im6.html#ChungHT09
4. M. Chung, F. Makedon, I. Sudborough, and J. Turner. (1985). Polynomial time algorithms for the min cut problem on degree restricted trees. SIAM J. Comput. [Online]. 14(1), pp. 158-177. Available: http://epubs.siam.org/doi/abs/10.1137/0214013
5. R. Cohen, S. Havlin, and D. Ben-Avraham, "Efficient immunization strategies for computer networks and populations," Phys. Rev. Lett., vol. 91, p. 247901, 2003.
6. K. Drakopoulos, A. Ozdaglar, and J. N. Tsitsiklis, Working Paper, 2015.
7. F. Gavril, "Some NP-complete problems on graphs," 11th Conf. Inf. Sci. Syst., 1977, pp. 91-95.
8. E. Gourdin, J. Omic, and P. Van Mieghem. (2011, Oct.). Optimization of network protection against virus spread. in Proc. 8th Int. Workshop Des. Rel. Commun. Netw., pp. 86-93. [Online]. Available: http://dx.doi.org/10.1109/drcn.2011.6076889
9. E. Korach and N. Solel. (1993). Tree-width, path-width, and cutwidth. Discrete Appl. Math. [Online]. 43(1), pp. 97-101. Available: http://www.sciencedirect.com/science/article/pii/ 0166218X9390171J
10. T. Leighton and R. Satish. (1999, Nov.). Multicommodity maxflow min-cut theorems and their use in designing approximation algorithms. J. ACM [Online]. 46(6), pp. 787-832. Available: http://doi.acm.org/10.1145/331524.331526
11. D. A. Levin, Y. Peres, and E. L. Wilmer. (2006). Markov Chains and Mixing Times [Online]. American Mathematical Society. Available: http://scholar.google.com/scholar.bib?q=info:3wf9IU94tyMJ: scholar.google.com/&output=citation&hl=en&as-sdt=2000&ct= citation&cd=0
12. F. Makedon and I. Sudborough. (1989). On minimizing width in linear layouts. Discrete Applied Mathematics [Online]. 23(3), pp. 243-265. Available: http://www.sciencedirect.com/science/article/pii/0166218X89900164
13. B. Monien and I. Sudborough. (1988). Min cut is NP-complete for edge weighted trees. Theoretical Comput. Sci. [Online]. 58(1-3), pp. 209-229. Available: http://www.sciencedirect.com/science/article/pii/030439758890028X
14. V. M. Preciado, M. Zargham, C. Enyioha, A. Jadbabaie, and G. J. Pappas. (2013). Optimal vaccine allocation to control epidemic outbreaks in arbitrary networks. CoRR, vol. abs/1303.3984 [Online]. Available: http://dblp.uni-trier.de/db/journals/corr/corr1303.html#abs-1303-3984
15. A. Sanjeev, F. Alan, and K. Haim. (2002). A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming [Online]. 92(1), pp. 1-36. Available: http://dx.doi.org/10.1007/s101070100271
16. J. M. Steele, Stochastic Calculus and Financial Applications. New York, NY, USA: Springer, 2000.
17. D. M. Thilikos, M. Serna, and H. L. Bodlaender. (2005, Jul.). Cutwidth I: A Linear Time Fixed Parameter Algorithm. J. Algorithms [Online]. 56(1), pp. 1-24. Available: http://dx.doi.org/10.1016/j. jalgor.2004.12.001