Pages that link to "Item:Q1884928"
From MaRDI portal
The following pages link to Routing algorithm for multicast under multi-tree model in optical networks (Q1884928):
Displaying 5 items.
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← 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)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← links)
