Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee
Summary: Efficient MCSS with probabilistic coverage; CLEAR for ECG with STAR-bound on OPT yields explicit ratios. MRR enables fast probability estimation for SCORE, PCG performance linked to ECG guarantees, delivering up to 100x speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chen Feng (Hong Kong Polytechnic University)
- 2. Xingguang Chen (National University of Singapore)
- 3. Qintian Guo (Chinese University of Hong Kong)
- 4. Fangyuan Zhang (Chinese University of Hong Kong)
- 5. Sibo Wang (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{feng_sigmod24,
title = {{Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee}},
author = {Feng, Chen and Chen, Xingguang and Guo, Qintian and Zhang, Fangyuan and Wang, Sibo},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3677133},
url = {https://dl.acm.org/doi/10.1145/3677133},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,495 | Robust Fair Influence Maximization under Multiple Community Partitions | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,795 | Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks | 2018 | SIGMOD |
| 2 | 2,260 | Online Topic-Aware Influence Maximization | 2015 | VLDB |
| 3 | 4,725 | Efficient Location-Aware Influence Maximization | 2014 | SIGMOD |
| 4 | 9,057 | Efficient Influence Minimization via Node Blocking | 2024 | VLDB |
| 5 | 10,809 | Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint | 2025 | VLDB |
| 6 | 4,804 | Efficient Algorithms for Adaptive Influence Maximization | 2018 | VLDB |
| 7 | 11,409 | Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach | 2023 | SIGMOD |
| 8 | 2,752 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB |
| 9 | 8,813 | Efficient and Effective Algorithms for Revenue Maximization in Social Advertising | 2021 | SIGMOD |
| 10 | 5,920 | Efficient Approximation Algorithms for Adaptive Seed Minimization | 2019 | SIGMOD |