Pages that link to "Item:Q1145507"

The following pages link to A fast algorithm for Steiner trees (Q1145507):

Displaying 50 items.

• On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
• Directed Steiner trees with diffusion costs (Q346492) (← links)
• A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
• A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
• Minimum cost multicast routing using ant colony optimization algorithm (Q473657) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• Models of greedy algorithms for graph problems (Q834580) (← links)
• Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
• Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
• Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← 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)
• A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← 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)
• Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038) (← links)
• Class Steiner trees and VLSI-design (Q1276969) (← links)
• Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
• The Steiner problem in distributed computing systems (Q1310949) (← links)
• Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
• A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
• A data structure for bicategories, with application to speeding up an approximation algorithm (Q1342258) (← links)
• Distributed multicast routing in point-to-point networks (Q1362952) (← links)
• Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
• Multiple multicast tree allocation in IP network. (Q1427119) (← links)
• Spanners and message distribution in networks. (Q1427197) (← links)
• Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
• The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
• Efficient and effective community search (Q1715901) (← links)
• Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks (Q1792411) (← links)
• Algorithms for multicast connection under multi-path routing model. (Q1853101) (← links)
• Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
• Adaptive Hagen-Poiseuille flows on graphs (Q2150406) (← links)
• Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic (Q2260900) (← links)
• Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
• An 11/6-approximation algorithm for the network Steiner problem (Q2366230) (← links)
• A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
• QoS multicast routing protocol in hierarchical wireless MANET (Q2481783) (← links)
• Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
• Informative labeling schemes for graphs (Q2566038) (← links)
• Combination algorithms for Steiner tree variants (Q2700384) (← links)
• An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)