Reduction tests for the steiner problem in grapsh
From MaRDI portal
Recommendations
Cites work
Cited in
(36)- An edge elimination test for the Steiner problem in graphs
- Reducing the hierarchical network design problem
- 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
- The partial sum criterion for Steiner trees in graphs and shortest paths
- Algorithms for a multi-level network optimization problem
- The dynamic predicate stashing copy problem and the Steiner problem in graphs
- A robust and scalable algorithm for the Steiner problem in graphs
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Solving minimum-cost shared arborescence problems
- Steiner systems for two-stage disjunctive testing
- Reduction tests for the prize-collecting Steiner problem
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- scientific article; zbMATH DE number 4139520 (Why is no real title available?)
- A test problem generator for the Steiner problem in graphs
- scientific article; zbMATH DE number 1163709 (Why is no real title available?)
- scientific article; zbMATH DE number 1947441 (Why is no real title available?)
- Strong Steiner tree approximations in practice
- Preprocessing Steiner problems from VLSI layout
- Parallel algorithms for a multi-level network optimization problem
- The edge-disjoing steiner problem in graphs
- An Exact Algorithm for the Steiner Forest Problem
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- New Reduction Techniques for the Group Steiner Tree Problem
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- Steiner trees and polyhedra
- Improved algorithms for the Steiner problem in networks
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Two fast algorithms for all-pairs shortest paths
- On reductions for the Steiner problem in graphs
This page was built for publication: Reduction tests for the steiner problem in grapsh
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826622)
