Pages that link to "Item:Q2576773"
From MaRDI portal
The following pages link to An improved approximation algorithm for multicast \(k\)-tree routing (Q2576773):
Displaying 13 items.
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem (Q1040584) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- Improved approximation algorithms for the quality of service multicast tree problem (Q2484000) (← links)
- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (Q3637083) (← links)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets (Q3801063) (← links)
- (Q4430838) (← links)
- Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)
- Approximation algorithms for the k-source multicast tree construction problem (Q5471088) (← links)
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667) (← links)