Reduction tests for the steiner problem in grapsh
From MaRDI portal
Publication:3826622
DOI10.1002/net.3230190506zbMath0673.05088OpenAlexW2068362339MaRDI QIDQ3826622
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190506
Related Items
Preprocessing Steiner problems from VLSI layout, A robust and scalable algorithm for the Steiner problem in graphs, Parallel algorithms for a multi-level network optimization problem, An edge elimination test for the Steiner problem in graphs, Reducing the hierarchical network design problem, Two fast algorithms for all-pairs shortest paths, On reductions for the Steiner problem in graphs, Solving Steiner trees: Recent advances, challenges, and perspectives, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems, Strong Steiner Tree Approximations in Practice, The edge-disjoing steiner problem in graphs, 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, Reduction tests for the prize-collecting Steiner problem, An Exact Algorithm for the Steiner Forest Problem, Decomposition methods for the two-stage stochastic Steiner tree problem, The partial inverse minimum spanning tree problem when weight increase is forbidden, Solving minimum-cost shared arborescence problems, Steiner's problem in graphs: Heuristic methods, Steiner trees and polyhedra, Improved algorithms for the Steiner problem in networks, Implications, conflicts, and reductions for Steiner trees, Implications, conflicts, and reductions for Steiner trees, The partial sum criterion for Steiner trees in graphs and shortest paths, The dynamic predicate stashing copy problem and the Steiner problem in graphs, Algorithms for a multi-level network optimization problem
Cites Work
