Efficient Influence Minimization via Node Blocking
Summary: First data-dependent approximation framework for Influence Minimization via node blocking: derive submodular monotone lower/upper bounds via a Sandwich framework and prove computing those bounds is #P-hard. Introduce advanced sampling and martingale-based concentration to cut sample complexity and deliver (1-1/e-ε)-approx algorithms for the bounds, achieving up to two orders of magnitude speedup in experiments. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jinghao Wang
- 2. Yanping Wu
- 3. Xiaoyang Wang
- 4. Ying Zhang
- 5. Lu Qin
- 6. Wenjie Zhang
- 7. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,527 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 4.4937074e-05 |
| 9,553 | Deep Overlapping Community Search via Subspace Embedding | 2025 | SIGMOD | 4.3254416e-05 |
| 10,120 | Time-Critical Influence Minimization via Node Blocking | 2026 | SIGMOD | 4.1945683e-05 |
| 10,313 | Augmenting Social Influence of Uncertain Seeds via Probabilistic Link Insertion | 2026 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next