Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode
From MaRDI portal
Recommendations
- Approximation Algorithms for Minimum-Time Broadcast
- Polynomial-time algorithms for minimum-time broadcast in trees
- A note on line broadcast in digraphs under the edge-disjoint paths mode
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
- On the complexity of the shortest-path broadcast problem
Cited in
(14)- Connectivity and minimum cut approximation in the broadcast congested clique
- A note on line broadcast in digraphs under the edge-disjoint paths mode
- Polynomial-time algorithms for minimum-time broadcast in trees
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Sublogarithmic approximation for telephone multicast
- An Efficient Vertex Addition Method for Broadcast Networks
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
- Minimal path broadcast networks
- Approximation Algorithms for Minimum-Time Broadcast
- Approximation algorithms in graphs with known broadcast time of the base graph
- Parameterized Complexity of Broadcasting in Graphs
- On the number of broadcast schemes in networks
- On the complexity of the shortest-path broadcast problem
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
This page was built for publication: Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796194)
