Pages that link to "Item:Q5466515"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466515):
Displaying 16 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)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- A multicommodity network flow application for the capacitated minimal spanning tree problem (Q1890671) (← links)
- The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Survivable network design: the capacitated minimum spanning network problem (Q2390307) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109) (← links)
- Approximating Airports and Railways (Q3304099) (← links)
- Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem (Q3394069) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- (Q4495206) (← links)
- A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem (Q4656658) (← links)
