Database Paper Browser

Back to papers

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)

Paper ID
13476
Venue
VLDB
Year
2024
Pagerank
4.427232e-05
Overall Rank
8,903 | 38.07%
DOI
10.14778/3675034.3675042

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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

Semantically Similar Papers