The following pages link to (Q3874241):
Displayed 50 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- An improved decomposition-based heuristic to design a water distribution network for an irrigation system (Q475224) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- A tabu search approach for solving a difficult forest harvesting machine location problem (Q863994) (← links)
- The network design problem with relays (Q869627) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← 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)
- Branch-and-bound as a higher-order function (Q1179748) (← 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)
- Class Steiner trees and VLSI-design (Q1276969) (← 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)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← 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)
- Generalized spanning trees (Q1579496) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
- The incremental connected facility location problem (Q2329719) (← links)