Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 624

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Maximizing Social Influence in Nearly Optimal Time

Borgs, Christian, Brautbar, Michael, Chayes, Jennifer, Lucier, Brendan·2014·Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms

Abstract

Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so that the expected size of the resulting cascade is maximized, under the standard independent cascade model of network diffusion. Runtime is a primary consideration for this problem due to the massive size of the relevant input networks. We provide a fast algorithm for the influence maximization problem, obtaining the near-optimal approximation factor of , for any ∊ > 0, in time O((m + n)∊−3 log n). Our algorithm is runtime-optimal (up to a logarithmic factor) and substantially improves upon the previously best-known algorithms which run in time Ω(mnk · POLY(∊−1)). Furthermore, our algorithm can be modified to allow early termination: if it is terminated after O(β(m + n) logn) steps for some β < 1 (which can depend on n), then it returns a solution with approximation factor O(β). Finally, we show that this runtime is optimal (up to logarithmic factors) for any β and fixed seed size k.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/1.9781611973402.70

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 624

Metadata

Authors
Borgs, C., Brautbar, M., Chayes, J., & Lucier, B.
Venue
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
Published
2013-12-18
Pages
946-957
OpenAlex
W2160411082
Cited by
624
References
1
FWCI
11.35
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Maximizing Social Influence in Nearly Optimal Time. https://app.cochat.ai/papers/10.1137/1.9781611973402.70
The paper
Borgs, C., Brautbar, M., Chayes, J., & Lucier, B. (2014). Maximizing Social Influence in Nearly Optimal Time. Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611973402.70

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.