Pages that link to "Item:Q5425447"
From MaRDI portal
The following pages link to Approximating Capacitated Tree-Routings in Networks (Q5425447):
Displaying 11 items.
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← 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)
- On the complexity of an optimal routing tree problem (Q1123140) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Capacitated Vehicle Routing on Trees (Q3980515) (← links)
- Automata, Languages and Programming (Q5466515) (← links)