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 11 items.
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- Optimization of loss-balanced multicast in all-optical WDM networks (Q857781) (← 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)
- Routing in sparse splitting optical networks with multicast traffic. (Q1398822) (← links)
- Algorithms for multicast connection under multi-path routing model. (Q1853101) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← links)
- Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach (Q3404464) (← links)
- Minimizing number of wavelengths in multicast routing trees in WDM networks (Q4506266) (← links)
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667) (← links)