Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.20026

On Hardness and Approximation of Broadcasting in Structured Graphs

Jeffrey Bringolf·Hovhannes A. Harutyunyan·Shahin Kamali·Seyed-Mohammad Seyed-Javadi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the Telephone Broadcasting problem in graphs with restricted structure. Given a designated source in an undirected graph, the goal is to disseminate a message to all vertices in the minimum number of rounds, where in each round every informed vertex may inform at most one neighbor. For general graphs, the problem is NP-hard. Recent work shows that the problem remains NP-hard even on restricted graph classes such as graphs of treewidth 2 [Tale 2025], cactus graphs of pathwidth 2 [Aminian et~al. 2025] and graphs at distance 1 to a path forest [Egami et~al. 2025]. In this work, we investigate the problem in several graph families. We first prove NP-hardness for cycle-star graphs, graphs formed by k cycles sharing a single vertex, as well as melon graphs, graphs formed by k paths with shared endpoints. Despite multiple efforts to understand the problem in these simple graph families, the computational complexity of the problem remained unsettled. Our hardness results answer open questions by Bhabak and Harutyunyan [2015] and Harutyunyan and Hovhannisyan [2023] concerning the problem's complexity in cycle-star and melon graphs, respectively. On the positive side, we present EPTASs for cycle-star and melon graphs, improving over the best existing approximation factors of 2 for both graph families. Moreover, we identify a structural frontier for tractability by showing that the problem is solvable in polynomial time on graphs of bounded cutwidth, a class that generalizes other families such as graphs of bounded bandwidth. This result subsumes existing tractability results for graph families such as necklace graphs. Finally, for split graphs, a fundamental class of highly structured graphs, we obtain a polynomial-time algorithm with approximation factor 1.76. This improves on the previously known factor 2 bound; the same approach also applies to the multi-source setting.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey Bringolf, Hovhannes A. Harutyunyan, Shahin Kamali, Seyed-Mohammad Seyed-Javadi. 2025-10-22. On Hardness and Approximation of Broadcasting in Structured Graphs. https://arxiv.org/abs/2510.20026

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗