scientific article; zbMATH DE number 1775430
From MaRDI portal
Publication:4542563
zbMath1028.68013MaRDI QIDQ4542563
Sudipto Guha, Amotz Bar-Noy, Joseph (Seffi) Naor, Baruch Schieber
Publication date: 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
The complexity of finding a broadcast center ⋮ The topology aware file distribution problem ⋮ A PTAS for geometric 2-FTP ⋮ Approximation algorithms in graphs with known broadcast time of the base graph ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ The worst case behavior of randomized gossip protocols ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ Broadcasting on cactus graphs ⋮ Concurrent multicast in weighted networks ⋮ A note on line broadcast in digraphs under the edge-disjoint paths mode ⋮ Concurrent multicast in weighted networks ⋮ Cooperative TSP ⋮ Compression using efficient multicasting ⋮ An approximation algorithm and dynamic programming for reduction in heterogeneous environments ⋮ On broadcasting in unicyclic graphs
This page was built for publication:
