Pages that link to "Item:Q5636922"

The following pages link to Steiner's problem in graphs and its implications (Q5636922):

Displaying 49 items.

• On the approximability of dense Steiner problems (Q396661) (← links)
• A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• Generalized Steiner problem in outerplanar networks (Q1074505) (← links)
• Steiner problem in Halin networks (Q1092013) (← links)
• An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
• Proving phylogenetic trees minimal with l-clustering and set partitioning (Q1144514) (← links)
• On locating new facilities in a competitive environment (Q1171986) (← links)
• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
• Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
• Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
• Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
• Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
• Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
• A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
• Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube (Q1332422) (← links)
• The point-to-point connection problem - analysis and algorithms (Q1377667) (← links)
• Connectivity calculus (Q1431949) (← links)
• The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
• Two variations of the minimum Steiner problem (Q1774532) (← links)
• Steiner's problem in double trees (Q1861809) (← links)
• The propagation of updates to relational tables in a distributed database system (Q1910779) (← links)
• A heuristic for the Steiner problem in graphs (Q1918915) (← links)
• An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
• Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
• Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Steiner distance and convexity in graphs (Q2426451) (← links)
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
• Combination algorithms for Steiner tree variants (Q2700384) (← links)
• On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
• A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
• Using structured steiner trees for hierarchical global routing (Q3348418) (← links)
• (Q3907583) (← links)
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
• Steiner 4-diameter, maximum degree and size of a graph (Q5087601) (← links)
• A Note on the Steiner<i>k</i>-Diameter of Tensor Product Networks (Q5087855) (← links)
• Bounds on the Steiner–Wiener index of graphs (Q5101912) (← links)
• The vertex steiner number of a graph (Q5139342) (← links)
• Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
• Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
• An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• A generalization of the Graham-Pollak tree theorem to Steiner distance (Q6197714) (← links)