Pages that link to "Item:Q2474074"
From MaRDI portal
The following pages link to An improved approximation algorithm for capacitated multicast routings in networks (Q2474074):
Displaying 11 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)
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem (Q1040584) (← links)
- The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- An improved approximation algorithm for multicast \(k\)-tree routing (Q2576773) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets (Q3801063) (← links)
- (Q4275189) (← links)
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667) (← links)