On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension

@article{Kahng1992OnTP,
  title={On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension},
  author={Andrew B. Kahng and Gabriel Robins},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
  year={1992},
  volume={11},
  pages={1462-1465}
}
We give a family of examples on which a large class C of "minimum spanning tree-based" rectilinear Steiner tree heuristics has performance ratio arbitrarily close to 3/2 times optimal. The class C contains many published heuristics whose worst-case performance ratio, were previously unknown. Of particular interest is that C contains two heuristics whose worst-case ratios had been conjectured to be bounded away from 3/2, and our construction also points out an incorrect claim of optimality for… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Ribiero, “ A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem,

  • C.C.C.C. de Souza
  • OR Spekrrum,
  • 1990

A greedy heuristic for the rectilinear Steiner tree problem,

  • M. W. Bern, M . De Carvalho
  • Computer Science Division (EECS),
  • 1986

Maximum Savings in the Steiner Problem in Phylogeny,

  • L. R . Foulds
  • J . Theorerical B i d . ,
  • 1984

Heuristic Algorithms for Rectilinear Steiner Trees,

  • M. Servit
  • Digital Process.,
  • 1981

An O(Nlog N) heuristic algorithm for the rectilinear Steiner minimal tree problem,

  • J . M. Smith, D. T. Lee, J. S. Liebman
  • Engineering Optimization,
  • 1980

An O ( n log n) algorithm for suboptimal rectilinear Steiner trees,

  • F. K. Hwang
  • IEEE Trans. Circuits Syst . , vol
  • 1979

Similar Papers

Loading similar papers…