社会网络中影响集选择的一个近似算法(英文)An Approximation Algorithm for the Influential Nodes Selection Problem in Social Network
冀桂琳,黄晓晖
摘要(Abstract)：
在研究社会网络影响集的选择问题中,目标是选取网络G中的一个最小点集S,使得V(G)-S中的每个点都至少有一半邻点在S中.本文给出一个α(△+1)/δ+1-近似算法,其中δ和△分别表示图G的最小度和最大度,α是局部独立数,它指示着图G的局部区域中最多含有的独立点的个数.
关键词(KeyWords)： 社会网络;影响集选择;近似算法;独立集
基金项目(Foundation): Supported by NSFC(61222201);; SRFDP(20126501110001);; Xinjiang talent project(2013711011)
作者(Author): 冀桂琳,黄晓晖
参考文献(References)：
- [1]Domingos P,Richardson M.Mining the network value of customers[C].in KDD’01:proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining,New York,NY,USA:ACM,2001,57-66.
- [2]Richardson M,Domingos P.Mining knowledge-sharing sites for viral marketing[C].in KDD’02:proceding of the eighth ACM SIGKDD international conference on knowledge discovery and data mining,New York,NY,USA:ACM,2002,61-70.
- [3]Kempe D,Kleinberg J,Tardos E.Maximizing the spread of influence through a social network[C].in KDD’03:proceedings of the ninth ACM SIGKDD international conference on knownledge discovery and data mining,New York,NY,USA:ACM,2003,137-146.
- [4]Kempe D,Kleinberg J,Tardos E.Influential Nodes in a Diffusion Model for Social Networks[J].in ICALP,Springer-Verlag,2005,3380:1127-1138.
- [5]Mossel E,Roch S.Submodularity of infuence in social networks:from local to global[J].SIAM J Comput,2010,39:2176-2188.
- [6]Zou F,Zhang Z,Wu W L.Latency-bounded minimum influence node selection in social networks[J].in:proceedings of workshop on Social Networks,Applications,and Systems,Boston,2009,5682:519-526.
- [7]Zou F,Willson J K,Zhang Z,et al.Fast information propagation in social networks[J].Discrete Mathematics,Algorithms and Applications,2010,2:125-141.
- [8]Bondy JA,Murty USR.Graph theory with application[M].London:Macmillan,1976.