An algorithm for the steiner problem in graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(48)- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- The telephonic switching centre network problem: Formalization and computational experience
- An edge elimination test for the Steiner problem in graphs
- Fast heuristic algorithms for rectilinear Steiner trees
- A constrained Steiner tree problem
- Finding minimum cost directed trees with demands and capacities
- The multi-weighted Steiner tree problem
- An approach for the Steiner problem in directed graphs
- The role of Steiner hulls in the solution to Steiner tree problems
- Path-distance heuristic for the Steiner problem in undirected networks
- Steiner's problem in graphs: Heuristic methods
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- The class Steiner minimal tree problem: A lower bound and test problem generation
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- A heuristic for the Steiner problem in graphs
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Reduction tests for the prize-collecting Steiner problem
- The Steiner problem in graphs: topological methods of solution
- scientific article; zbMATH DE number 3871417 (Why is no real title available?)
- scientific article; zbMATH DE number 5158878
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- An SST-based algorithm for the steiner problem in graphs
- scientific article; zbMATH DE number 49566 (Why is no real title available?)
- An integer programming formulation of the Steiner problem in graphs
- scientific article; zbMATH DE number 599372 (Why is no real title available?)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- A test problem generator for the Steiner problem in graphs
- A branch and cut algorithm for the Steiner problem in graphs
- Solving Steiner tree problems in graphs to optimality
- Preprocessing Steiner problems from VLSI layout
- scientific article; zbMATH DE number 1424551 (Why is no real title available?)
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- A faster approximation algorithm for the Steiner problem in graphs
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Improved algorithms for the Steiner problem in networks
- Heuristic algorithms for packing of multiple-group multicasting
- Approximation algorithms for Steiner forest: An experimental study
- An exact branch and bound algorithm for the Steiner Problem in Graphs
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Optimizing the Design of a Wind Farm Collection Network
- Vertex covering with capacitated trees
- Tree network design avoiding congestion
- Node-weighted Steiner tree approximation in unit disk graphs
- On reductions for the Steiner problem in graphs
- A factoring approach for the Steiner tree problem in undirected networks
This page was built for publication: An algorithm for the steiner problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896365)
