Influence maximization is APX-hard on DAGs under LT, exactly solvable on out-arborescences for both IC and LT, and admits FPTAS on in-arborescences under IC.
Journal of Consumer Research14(3), 350–362 (12 1987)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
Influence maximization is APX-hard on DAGs under LT, exactly solvable on out-arborescences for both IC and LT, and admits FPTAS on in-arborescences under IC.