Pages that link to "Item:Q3826622"

The following pages link to Reduction tests for the steiner problem in grapsh (Q3826622):

Displaying 29 items.

• Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
• On reductions for the Steiner problem in graphs (Q876697) (← links)
• An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
• Reducing the hierarchical network design problem (Q1121181) (← 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)
• The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
• The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
• Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
• The edge-disjoing steiner problem in graphs (Q4893707) (← links)
• An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
• Steiner trees and polyhedra (Q5946818) (← links)
• Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)