DBScholar

Back to papers

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)

Paper ID
7025
Venue
SIGMOD
Year
2024
Pagerank
5.3483178e-05
Overall Rank
8,913 | 38.85%
DOI
10.1145/3677133

Incoming Non-self Citations Over Time

Authors

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