Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2606.00585 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916070453936128 |
|---|---|
| author | Liu, Panfeng Tao, Biaoshuai |
| author_facet | Liu, Panfeng Tao, Biaoshuai |
| contents | This paper investigates the influence maximization problem under the Independent Cascade(IC) and Linear Threshold (LT) models. While this problem is known to be APX-hard on general graphs, we explore its computational limits by focusing on Directed Acyclic Graphs (DAGs) and more restricted tree structures. Our primary result demonstrates that influence maximization remains APX-hard on DAGs under the LT model, suggesting that the absence of cycles is insufficient to achieve a polynomial-time approximation scheme (PTAS). In contrast, we show that the problem becomes tractable when the topology is further restricted to out-arborescences and in-arborescences. Specifically, for out-arborescences, we show that the IC model and the LT model are equivalent, and we develop exact polynomial-time algorithms based on dynamic programming that leverage the unique path properties of these structures. For in-arborescences, it is known that the problem is polynomial-time solvable under the LT model, and it is NP-hard under the IC model. We complement these results by presenting a fully polynomial-time approximation scheme (FPTAS) for the IC model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00585 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs Liu, Panfeng Tao, Biaoshuai Computer Science and Game Theory This paper investigates the influence maximization problem under the Independent Cascade(IC) and Linear Threshold (LT) models. While this problem is known to be APX-hard on general graphs, we explore its computational limits by focusing on Directed Acyclic Graphs (DAGs) and more restricted tree structures. Our primary result demonstrates that influence maximization remains APX-hard on DAGs under the LT model, suggesting that the absence of cycles is insufficient to achieve a polynomial-time approximation scheme (PTAS). In contrast, we show that the problem becomes tractable when the topology is further restricted to out-arborescences and in-arborescences. Specifically, for out-arborescences, we show that the IC model and the LT model are equivalent, and we develop exact polynomial-time algorithms based on dynamic programming that leverage the unique path properties of these structures. For in-arborescences, it is known that the problem is polynomial-time solvable under the LT model, and it is NP-hard under the IC model. We complement these results by presenting a fully polynomial-time approximation scheme (FPTAS) for the IC model. |
| title | Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2606.00585 |