Pages that link to "Item:Q344954"

The following pages link to On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954):

Displaying 9 items.

• Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
• The last dozen of years of or research in Czechia and Slovakia (Q2673270) (← links)
• On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q2969617) (← links)
• An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
• (Q4252355) (← links)
• A comparison of Steiner tree relaxations (Q5946825) (← 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)