On the approximability of influence in social networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1029-1037

  Chen, Ning ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; CONSTANT DEGREE; GRAPH MODELING; NEW PRODUCTS; POLY-LOGARITHMIC FACTORS;

GRAPH THEORY;

TREES (MATHEMATICS);

EID: 58449086166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. A. Aazami, M. D. Stilp, Approximation Algorithms and Hardness for Domination with Propagation, APPROX 2007, 1-15.
2. M. Ajtai, J. Komlós, E. Szemerédi. An O(n log n) Sorting Network (Sorting in clog n Parallel Steps), Combinatorica, V. 3(1), 1-19, 1983.
3. E. Arcaute, A. Kirsch, R. Kumar, D. Liben-Nowell, S. Vassilvitskii, On Threshold Behavior in Query Incentive Networks, EC 2007, 66-74.
4. J. Aspnes, K. Chang, A. Yampolskiy, Inoculation Strategies for Victims of Viruses and the Sum-of- Squares Partition Problem, SODA 2005, 43-52.
5. E. Berger, Dynamic Monopolies of Constant Size, Journal of Combinatorial Theory B, V. 83(2), 191-200, 2001.
6. N. Berger, C. Borgs, J. T. Chayes, A. Saberi, On the Spread of Viruses on the Internet, SODA 2005, 301-310.
7. Z. Dezso, A.-L. Barabasi, Halting Viruses in Scale-Free Networks. Physical Review E, V. 65, 2002.
8. I. Dinur, S. Safra, The Importance of Being Biased, STOC 2002, 33-42.
9. P. Domingos, M. Richardson, Mining the Network Value of Customers, KDD 2001, 57-66.
10. P. A. Dreyer, Applications and Variations of Domination in Graphs, Ph.D. Thesis, Rutgers University, 2000.
11. A. Ganesh, L. Massouli, D. Towsley, The Effect of Network Topology on the Spread of Epidemics, INFOCOM 2005, 1455-1466.
12. N. Immorlica, J. M. Kleinberg, M. Mahdian, T. Wexler, The Role of Compatibility in the Diffusion of Technologies through Social Networks, EC 2007, 75-83.
13. M. Kearns, L. Ortiz, Algorithms for Interdependent Security Games, NIPS 2003, 288-297.
14. D. Kempe, J. Kleinberg, É. Tardos, Maximizing the Spread of Influence through a Social Network, KDD 2003, 137-146.
15. D. Kempe, J. Kleinberg, É. Tardos, Influential Nodes in a Diffusion Model for Social Networks, ICALP 2005, 1127-1138.
16. J. M. Kleinberg, P. Raghavan, Query Incentive Networks, FOCS 2005, 132-141.
17. D. E. Knuth, The Art of Computer Programming, V. 3, Sorting and Searching, 3rd edition, Addison-Wesley, 1997.
18. G. Kortsarz, On the Hardness of Approximating Spanners, Algorithmica, V. 30(3), 432-450, 2001.
19. G. Kortsarz, R. Krauthgamer, J. R. Lee, Hardness of Approximating Vertex-Connectivity Network Design Problems, SIAM Journal on Computing, V. 33(3), 704-720, 2004.
20. N. Linial, D. Peleg, Y. Rabinovich, M. Saks, Sphere Packing and Local Majorities in Graphs, ISTCS 1993, 141-149.
21. S. Morris, Contagion, Review of Economic Studies, V. 67, 57-78, 2000.
22. E. Mossel, S. Roch, On the Submodularity of Influence in Social Networks, STOC 2007, 128-134.
23. R. Pastor-Satorras, A. Vespignani, Epidemics and Immunization in Scale-Free Networks, Handbook of Graphs and Networks: From the Genome to the Internet, edited by S. Bornholdt, H. G. Schuster, 111-130, Wiley-VCH, 2003.
24. D. Peleg, Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review, in Proceedings of the 3rd Colloquium on Structural Information & Communication Complexity, 170-179, 1996.
25. D. Peleg, Size Bounds for Dynamic Monopolies, Discrete Applied Mathematics, V. 86, 263-273, 1998.
26. R. Raz, A Parallel Repetition Theorem, SIAM J. Computing, V. 27(3), 763-803, 1998.
27. M. Richardson, P. Domingos, Mining Knowledge- Sharing Sites for Viral Marketing, KDD 2002, 61-70.
28. F. S. Roberts, Challenges for Discrete Mathematics and Theoretical Computer Science in the Defense against Bioterrorism, Mathematical and Modeling Approaches in Homeland Security, SIAM Frontiers in Applied Mathematics Series, edited by H. T. Banks, C. Castillo- Chavez, 1-34, 2003.
29. F. S. Roberts, Graph-Theoretical Problems Arising from Defending Against Bioterrorism and Controlling the Spread of Fires, DIMACS/DIMATIA/Renyi Combinatorial Challenges Conference, 2006.
30. V. V. Vazirani, Approximation Algorithms, Springer- Verlag, 2001.
31. D. J. Watts, S. H. Strogatz, Collective Dynamics of 'Small-World' Networks, Nature, V. 393, 440-442, 1998.