Pages that link to "Item:Q4847364"
From MaRDI portal
The following pages link to Approximation Algorithms for Minimum-Time Broadcast (Q4847364):
Displaying 19 items.
- Broadcasting on cactus graphs (Q512890) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- On broadcasting in unicyclic graphs (Q1029711) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Sublogarithmic approximation for telephone multicast (Q2495404) (← links)
- (Q3474496) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Degree- and time-constrained broadcast networks (Q4537618) (← links)
- A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- Tighter bounds on the minimum broadcast time (Q6122083) (← links)
- A note to non-adaptive broadcasting (Q6536205) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)
- Improved approximation for broadcasting in k-path graphs (Q6606222) (← links)
- Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)
