Author:
Dinh Thang N.,Shen Yilin,Nguyen Dung T.,Thai My T.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference21 articles.
1. Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: STOC ’00. ACM, New York, pp 171–180. http://doi.acm.org/10.1145/335305.335326
2. Chlebík M, Chlebíková J (2004) Approximation hardness of dominating set problems. In: ESA’04, pp. 192–203
3. Cicalese F, Milanič M, Vaccaro U (2011) Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. In: Proceedings of the 18th international conference on fundamentals of computation theory, FCT’11. Springer, Berlin, pp 288–297. http://dl.acm.org/citation.cfm?id=2034214.2034239
4. Dinh TN, Dung NT, Thai MT (2012) Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In: Proceedings of the 23rd ACM conference on hypertext and social media, HT ’12. ACM, Milwaukee
5. Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD ’01. ACM, New York, pp 57–66. http://doi.acm.org/10.1145/502512.502525
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献