Improved algorithms for the Steiner problem in networks

@article{Polzin2001ImprovedAF,
  title={Improved algorithms for the Steiner problem in networks},
  author={T. Polzin and S. V. Daneshmand},
  journal={Discret. Appl. Math.},
  year={2001},
  volume={112},
  pages={263-300}
}
  • T. Polzin, S. V. Daneshmand
  • Published 2001
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • We present several new techniques for dealing with the Steiner problem in (undirected) networks. We consider them as building blocks of an exact algorithm, but each of them could also be of interest in its own right. First, we consider some relaxations of integer programming formulations of this problem and investigate different methods for dealing with these relaxations, not only to obtain lower bounds, but also to get additional information which is used in the computation of upper bounds and… CONTINUE READING
    Algorithms for the Steiner problem in networks
    • 65
    • PDF
    On Steiner trees and minimum spanning trees in hypergraphs
    • 532
    A comparison of Steiner tree relaxations
    • 68
    • PDF
    On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
    • 48
    • Highly Influenced
    Extending Reduction Techniques for the Steiner Tree Problem
    • 27
    A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
    • 168
    • PDF
    Preprocessing Steiner problems from VLSI layout
    • 40

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 37 REFERENCES
    Solving Steiner tree problems in graphs to optimality
    • 183
    • Highly Influential
    • PDF
    Solving Steiner Tree Problems in Graphs to Optimality
    • 115
    • Highly Influential
    • PDF
    A Faster Approximation Algorithm for the Steiner Problem in Graphs
    • 332
    An SST-based algorithm for the steiner problem in graphs
    • 161
    • Highly Influential
    An algorithm for the steiner problem in graphs
    • 147
    • Highly Influential
    Exact Algorithms for Plane Steiner Tree Problems: A Computational Study
    • 184
    A comparison of Steiner tree relaxations
    • 68
    • PDF
    An integer linear programming approach to the steiner problem in graphs
    • Y. Aneja
    • Mathematics, Computer Science
    • 1980
    • 148
    A dual ascent approach for steiner tree problems on a directed graph
    • R. Wong
    • Mathematics, Computer Science
    • 1984
    • 348
    • Highly Influential
    Reduction tests for the steiner problem in grapsh
    • 78
    • Highly Influential