On Steiner trees and minimum spanning trees in hypergraphs
From MaRDI portal
Publication:1869998
DOI10.1016/S0167-6377(02)00185-2zbMath1013.90131MaRDI QIDQ1869998
Siavash Vahdati Daneshmand, Tobias Polzin
Publication date: 4 May 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items (16)
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree ⋮ Chvátal-Gomory cuts for the Steiner tree problem ⋮ Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound ⋮ Stronger path‐based extended formulation for the Steiner tree problem ⋮ A linear programming based approach to the Steiner tree problem with a fixed number of terminals ⋮ Steiner tree packing revisited ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Computing Euclidean Steiner trees over segments ⋮ Strong Steiner Tree Approximations in Practice ⋮ The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study ⋮ A partition-based relaxation for Steiner trees ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Approaches to the Steiner Problem in Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Steiner tree problem
- A dual ascent approach for steiner tree problems on a directed graph
- An integer linear programming approach to the steiner problem in graphs
- Solving Steiner tree problems in graphs to optimality
- A comparison of Steiner tree relaxations
- Improved algorithms for the Steiner problem in networks
This page was built for publication: On Steiner trees and minimum spanning trees in hypergraphs
