Pages that link to "Item:Q5505667"
From MaRDI portal
The following pages link to An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667):
Displaying 15 items.
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← 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)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- On multi-path routing for reliable communications in failure interdependent complex networks (Q2025105) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks (Q2424872) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- An improved approximation algorithm for multicast \(k\)-tree routing (Q2576773) (← links)
- Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks (Q3467852) (← links)
- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (Q3637083) (← links)
- (Q4430838) (← links)
- Approximating Capacitated Tree-Routings in Networks (Q5425447) (← links)
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667) (← links)
