暂无分享,去创建一个
Rajeev Motwani | Aneesh Sharma | Ying Xu | David Arthur | R. Motwani | Aneesh Sharma | David Arthur | Ying Xu
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] R. Ravi,et al. Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.
[3] Roberto Solis-Oba,et al. A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.
[4] Matthew Richardson,et al. Mining the network value of customers , 2001, KDD '01.
[5] S H Strogatz,et al. Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[6] Jure Leskovec,et al. Patterns of Influence in a Recommendation Network , 2006, PAKDD.
[7] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[8] J. Kleinberg. Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .
[9] Krishna P. Gummadi,et al. Measurement and analysis of online social networks , 2007, IMC '07.
[10] Jure Leskovec,et al. The dynamics of viral marketing , 2005, EC '06.
[11] Vahab S. Mirrokni,et al. Optimal marketing strategies over social networks , 2008, WWW.
[12] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[13] D. Karpov. Spanning trees with many leaves , 2011 .