Pages that link to "Item:Q4750659"
From MaRDI portal
The following pages link to The computation of nearly minimal Steiner trees in graphs (Q4750659):
Displaying 20 items.
- Minimum cost multicast routing using ant colony optimization algorithm (Q473657) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Worst-case performance of Rayward-Smith's Steiner tree heuristic (Q1114397) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- The Steiner problem in distributed computing systems (Q1310949) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- Distributed multicast routing in point-to-point networks (Q1362952) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- Motif statistics. (Q1853502) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
