Broadcasting under Structural Restrictions
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912334215118848 |
|---|---|
| author | Egami, Yudai Gima, Tatsuya Hanaka, Tesshu Kobayashi, Yasuaki Lampis, Michael Mitsou, Valia Nemery, Edouard Otachi, Yota Vasilakis, Manolis Vaz, Daniel |
| author_facet | Egami, Yudai Gima, Tatsuya Hanaka, Tesshu Kobayashi, Yasuaki Lampis, Michael Mitsou, Valia Nemery, Edouard Otachi, Yota Vasilakis, Manolis Vaz, Daniel |
| contents | In the Telephone Broadcast problem we are given a graph $G=(V,E)$ with a designated source vertex $s\in V$. Our goal is to transmit a message, which is initially known only to $s$, to all vertices of the graph by using a process where in each round an informed vertex may transmit the message to one of its uninformed neighbors. The optimization objective is to minimize the number of rounds.
Following up on several recent works, we investigate the structurally parameterized complexity of Telephone Broadcast. In particular, we first strengthen existing NP-hardness results by showing that the problem remains NP-complete on graphs of bounded tree-depth and also on cactus graphs which are one vertex deletion away from being path forests. Motivated by this (severe) hardness, we study several other parameterizations of the problem and obtain FPT algorithms parameterized by vertex integrity (generalizing a recent FPT algorithm parameterized by vertex cover by Fomin, Fraigniaud, and Golovach [TCS 2024]) and by distance to clique, as well as FPT approximation algorithms parameterized by clique-cover and cluster vertex deletion. Furthermore, we obtain structural results that relate the length of the optimal broadcast protocol of a graph $G$ with its pathwidth and tree-depth. By presenting a substantial improvement over the best previously known bound for pathwidth (Aminian, Kamali, Seyed-Javadi, and Sumedha [arXiv 2025]) we exponentially improve the approximation ratio achievable in polynomial time on graphs of bounded pathwidth from $\mathcal{O}(4^\mathrm{pw})$ to $\mathcal{O}(\mathrm{pw})$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_13669 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Broadcasting under Structural Restrictions Egami, Yudai Gima, Tatsuya Hanaka, Tesshu Kobayashi, Yasuaki Lampis, Michael Mitsou, Valia Nemery, Edouard Otachi, Yota Vasilakis, Manolis Vaz, Daniel Data Structures and Algorithms Computational Complexity In the Telephone Broadcast problem we are given a graph $G=(V,E)$ with a designated source vertex $s\in V$. Our goal is to transmit a message, which is initially known only to $s$, to all vertices of the graph by using a process where in each round an informed vertex may transmit the message to one of its uninformed neighbors. The optimization objective is to minimize the number of rounds. Following up on several recent works, we investigate the structurally parameterized complexity of Telephone Broadcast. In particular, we first strengthen existing NP-hardness results by showing that the problem remains NP-complete on graphs of bounded tree-depth and also on cactus graphs which are one vertex deletion away from being path forests. Motivated by this (severe) hardness, we study several other parameterizations of the problem and obtain FPT algorithms parameterized by vertex integrity (generalizing a recent FPT algorithm parameterized by vertex cover by Fomin, Fraigniaud, and Golovach [TCS 2024]) and by distance to clique, as well as FPT approximation algorithms parameterized by clique-cover and cluster vertex deletion. Furthermore, we obtain structural results that relate the length of the optimal broadcast protocol of a graph $G$ with its pathwidth and tree-depth. By presenting a substantial improvement over the best previously known bound for pathwidth (Aminian, Kamali, Seyed-Javadi, and Sumedha [arXiv 2025]) we exponentially improve the approximation ratio achievable in polynomial time on graphs of bounded pathwidth from $\mathcal{O}(4^\mathrm{pw})$ to $\mathcal{O}(\mathrm{pw})$. |
| title | Broadcasting under Structural Restrictions |
| topic | Data Structures and Algorithms Computational Complexity |
| url | https://arxiv.org/abs/2504.13669 |