Pages that link to "Item:Q3790913"
From MaRDI portal
The following pages link to Steiner problem in networks: A survey (Q3790913):
Displayed 50 items.
- The computational complexity of the reliability problem on distributed systems (Q287259) (← links)
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← 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)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← 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)
- Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← 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)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- A neural network for the Steiner minimal tree problem (Q1323577) (← 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)
- Steiner distance stable graphs (Q1336650) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Distributed multicast routing in point-to-point networks (Q1362952) (← links)
- Spanners and message distribution in networks. (Q1427197) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Digital data networks design using genetic algorithms (Q1590811) (← links)
- A deep-submicron Steiner tree. (Q1597158) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks (Q1792411) (← links)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)