Pages that link to "Item:Q2495404"
From MaRDI portal
The following pages link to Sublogarithmic approximation for telephone multicast (Q2495404):
Displaying 12 items.
- The topology aware file distribution problem (Q386444) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Broadcasting on networks of workstations (Q973010) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking (Q1941696) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- An approximation algorithm for the directed telephone multicast problem (Q2505499) (← 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)
- A note to non-adaptive broadcasting (Q6536205) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)