Combinatorial model and bounds for target set selection

Theoretical Computer Science

Volumn 411, Issue 44-46, 2010, Pages 4017-4022

  Ackerman, Eyal ^a   Ben Zwi, Oren ^a   Wolfovitz, Guy ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Monotone irreversible dynamic monopoly (dynamo); Target set selection

Indexed keywords

ACTIVATION PROCESS; COMBINATORIAL MODELS; CONSTANT FACTOR APPROXIMATION; CONSUMER BEHAVIORS; DEGREE GRAPHS; DIFFUSION PROCESS; DIRECTED GRAPHS; GRAPH G; LINEAR INTEGER PROGRAMS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MONOTONE IRREVERSIBLE DYNAMIC MONOPOLY (DYNAMO); POLYLOGARITHMIC APPROXIMATION; PUBLIC AFFAIRS; REGULAR GRAPHS; SELECTION PROBLEMS; UNDIRECTED GRAPH; UPPER BOUND; VIRAL MARKETING;

COMPETITION; ELECTRIC GENERATORS; GRAPHIC METHODS; INTEGER PROGRAMMING; INTERACTIVE DEVICES;

GRAPH THEORY;

EID: 77957669941     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.08.021     Document Type: Article

References (27)

1. R. Bar-Yehuda, and S. Even A linear time approximation algorithm for the weighted vertex cover problem J. Algorithms 2 1981 198 203
2. O. Ben-Zwi, D. Hermelin, D. Lokshtanov, and I. Newman An exact almost optimal algorithm for target set selection in social networks J. Chuang, L. Fortnow, P. Pu, ACM Conference on Electronic Commerce 2009 ACM 355 362
3. E. Berger Dynamic monopolies of constant size J. Combin. Theory, Ser. B 83 2 2001 191 200
4. C. Chang, and Y. Lyuu Spreading messages Theoret. Comput. Sci. 410 2729 2009 2714 2724
5. C. Chang, Y. Lyuu, Bounding the number of tolerable faults in majority-based systems, in: Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 2628, 2010. Proceedings, 2010, pp. 109119.
6. N. Chen, On the approximability of influence in social networks, in: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2008, pp. 10291037.
7. Z. Dezs, and A. Barabsi Halting viruses in scale-free networks Phys. Rev. E 65 5 2002 055103
8. P. Domingos, M. Richardson, Mining the network value of customers, in: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, 2001, pp. 5766.
9. P. Flocchini, F. Geurts, and N. Santoro Optimal irreversible dynamos in chordal rings Discrete Appl. Math. 113 1 2001 23 42
10. P. Flocchini, R. Krlovi, P. Ruika, A. Roncato, and N. Santoro On time versus size for monotone dynamic monopolies in regular topologies J. Discrete Algorithms 1 2 2003
11. L.C. Freeman The Development of Social Network Analysis: A Study in the Sociology of Science 2004 Empirical Press Vancouver, BC, Canada
12. M.S. Granovetter The strength of weak ties Amer. J. Sociol. 78 1973 1360 1380
13. E. Katz, and P.F. Lazarsfeld Images of the mass communications process Personal Influence: The Part Played by People in the Flow of Mass Communications 1955 Free Press Glencoe, IL
14. M. Kearns, L. Ortiz, Algorithms for interdependent security games, in: Proceedings of the 17th Annual Conference on Advances in Neural Information Processing Systems, NIPS, 2003, pp. 288297.
15. D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, 2003, pp. 137146.
16. D. Kempe, J. Kleinberg, E. Tardos, Influential nodes in a diffusion model for social networks, in: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP, 2005, pp. 11271138.
17. F. Luccio, L. Pagli, and H. Sanossian Irreversible dynamos in butterflies C. Gavoille, J.-C. Bermond, A. Raspaud, SIROCCO 1999 Carleton Scientific 204 218
18. R.T. Mikolajczyk, and M. Kretzschmar Collecting social contact data in the context of disease transmission: prospective and retrospective study designs Soc. Netw. 30 2 2008 127 135
19. S. Milgram The small world problem Psychol. Today 2 1967 60 67
20. S. Morris Contagion Rev. Econom. Stud. 67 1 2000 57 78
21. E. Mossel, S. Roch, On the submodularity of influence in social networks, in: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC, 2007, pp. 128134.
22. R. Pastor-Satorras, and A. Vespignani Epidemic spreading in scale-free networks Phys. Rev. Lett. 86 14 2001 3200 3203
23. D. Peleg Size bounds for dynamic monopolies Discrete Appl. Math. 86 23 1998 263 273
24. D. Peleg Local majorities, coalitions and monopolies in graphs: a review Theoret. Comput. Sci. 282 2 2002 231 257
25. J. Spencer Ten Lectures on the Probabilistic Method 1987 SIAM
26. V.V. Vazirani Approximation Algorithms 2001 Springer-Verlag Berlin
27. D.S. Wilson Levels of selection: an alternative to individualism in biology and the human sciences Soc. Netw. 11 3 1989 257 272