Some formulations for the group Steiner tree problem
From MaRDI portal
Publication:2500536
Recommendations
- scientific article; zbMATH DE number 1303564
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- scientific article; zbMATH DE number 2119643
- New Reduction Techniques for the Group Steiner Tree Problem
- Approximation algorithm for the group Steiner network problem
- A greedy approximation algorithm for the group Steiner problem
- Solving group Steiner problems as Steiner problems.
- Bounded Degree Group Steiner Tree Problems
- An improved approximation scheme for the Group Steiner Problem
- A catalog of steiner tree formulations
Cites work
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 219235 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A note on the generalized Steiner tree polytope
- A theorem on flows in networks
- Rectilinear group Steiner trees and applications in VLSI design
- Solving group Steiner problems as Steiner problems.
- The Complexity of Multiterminal Cuts
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The class Steiner minimal tree problem: A lower bound and test problem generation
Cited in
(3)
This page was built for publication: Some formulations for the group Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500536)