Pages that link to "Item:Q5471088"

The following pages link to Approximation algorithms for the k-source multicast tree construction problem (Q5471088):

Displaying 12 items.

• The shared broadcast tree problem and MST (Q510900) (← links)
• Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
• Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks (Q852254) (← links)
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem (Q1040584) (← links)
• Minimum time broadcast in faulty star networks (Q1392530) (← links)
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
• An approximation algorithm for the directed telephone multicast problem (Q2505499) (← links)
• An improved approximation algorithm for multicast \(k\)-tree routing (Q2576773) (← links)
• Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (Q3637083) (← links)
• (Q4430838) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5901295) (← links)
• A multicast tree construction algorithm for large multiparty conferences (Q5944457) (← links)