Pages that link to "Item:Q5636922"
From MaRDI portal
The following pages link to Steiner's problem in graphs and its implications (Q5636922):
Displayed 30 items.
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← 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)
- 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)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← 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)
- Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)