Pages that link to "Item:Q1869998"

The following pages link to On Steiner trees and minimum spanning trees in hypergraphs (Q1869998):

Displaying 22 items.

• On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
• A partition-based relaxation for Steiner trees (Q535014) (← links)
• Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
• Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
• Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
• Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
• Full minimal Steiner trees on lattice sets (Q1356020) (← links)
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
• Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
• Steiner tree packing revisited (Q1935940) (← links)
• Computing Euclidean Steiner trees over segments (Q2219516) (← links)
• Minimal spanning trees and Stein's method (Q2403137) (← links)
• Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
• Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
• Approaches to the Steiner Problem in Networks (Q3637313) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
• Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)