On the complexity of the shortest-path broadcast problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2016

On the complexity of the shortest-path broadcast problem

Abstract

We study the shortest-path broadcast problem in graphs and digraphs, where a message has to be transmitted from a source node s to all the nodes along shortest paths, in the classical telephone model. For both graphs and digraphs, we show that the problem is equivalent to the broadcast problem in layered directed graphs. We then prove that this latter problem is NP-hard, and therefore that the shortest-path broadcast problem is NP-hard in graphs as well as in digraphs. Nevertheless, we prove that a simple polynomial-time algorithm, called MDST-broadcast, based on min-degree spanning trees, approximates the optimal broadcast time within a multiplicative factor 3/2 in 3-layer digraphs, and O(log n/loglog n) in arbitrary multi-layer digraphs. As a consequence, one can approximate the optimal shortest-path broadcast time in polynomial time within a multiplicative factor 3/2 whenever the source has eccentricity at most 2, and within a multiplicative factor O(log n/\log\log n) in the general case, for both graphs and digraphs. The analysis of MDST-broadcast is tight, as we prove that this algorithm cannot approximate the optimal broadcast time within a factor smaller than Omega(log n/log\log n).
Fichier principal
Vignette du fichier
broadcast.pdf (361.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01255198 , version 1 (13-01-2016)

Identifiers

Cite

Pierluigi Crescenzi, Pierre Fraigniaud, Magnus M. Halldorsson, Hovhannes Harutyunyan, Chiara Pierucci, et al.. On the complexity of the shortest-path broadcast problem. Discrete Applied Mathematics, 2016, 199, pp.101-109. ⟨10.1016/j.dam.2015.05.004⟩. ⟨hal-01255198⟩
329 View
262 Download

Altmetric

Share

Gmail Facebook X LinkedIn More