Pages that link to "Item:Q5896365"
From MaRDI portal
The following pages link to An algorithm for the steiner problem in graphs (Q5896365):
Displaying 33 items.
- Tree network design avoiding congestion (Q646180) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- On reductions for the Steiner problem in graphs (Q876697) (← links)
- 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)
- The telephonic switching centre network problem: Formalization and computational experience (Q1093558) (← links)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← 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)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Dynamic programming for spanning tree problems: application to the multi-objective case (Q2018859) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- An integer programming formulation of the Steiner problem in graphs (Q4031973) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms (Q5202521) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- A faster approximation algorithm for the Steiner problem in graphs (Q5903117) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
- Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Optimizing the Design of a Wind Farm Collection Network (Q6102753) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
