An upper bound based greedy algorithm for mining top-k influential nodes in social networks.

@inproceedings{zhou-2014-upper, author = {Chuan Zhou and Peng Zhang and Jing Guo and Li Guo}, editor = {Chin-Wan Chung and Andrei Z. Broder and Kyuseok Shim and Torsten Suel}, title = {{An upper bound based greedy algorithm for mining top-k influential nodes in social networks}}, booktitle = {{23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume}}, pages = {421--422}, publisher = {ACM}, year = {2014}, url = {https://doi.org/10.1145/2567948.2577336}, doi = {https://doi.org/10.1145/2567948.2577336} }