Influence Maximization via Vertex Countering
Summary: Introduces influence countering: rather than seeding only unadopted users, a company flips up to b competitors’ seeds to maximize adoption under Multi-Campaigner IC. Despite #P-hardness, MIC/MIC+ deliver high-probability (1−ε)-approximations via sampling and support dynamic graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jiadong Xie (Chinese University of Hong Kong; Guangdong University of Technology)
- 2. Zehua Chen (Guangdong University of Technology)
- 3. Deming Chu (University of New South Wales)
- 4. Fan Zhang (Guangdong University of Technology)
- 5. Xuemin Lin (Shanghai Jiao Tong University)
- 6. Zhihong Tian (Guangdong University of Technology)
BibTeX Citation
@article{xie_vldb24,
title = {{Influence Maximization via Vertex Countering}},
author = {Xie, Jiadong and Chen, Zehua and Chu, Deming and Zhang, Fan and Lin, Xuemin and Tian, Zhihong},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {6},
pages = {1297--1309},
doi = {10.14778/3648160.3648171},
url = {https://doi.org/10.14778/3648160.3648171},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,903 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 5.2534908e-05 |
| 11,224 | Most Similar Biclique Search at Scale | 2025 | VLDB | 4.9769913e-05 |
| 11,529 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next