A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear steiner tree problem

Publisher Website

1 June 1990

journal article
Published by Springer Nature in OR Spectrum

Vol. 12 (2) , 109-111
https://doi.org/10.1007/bf01784988

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

AN 0 (N log N) HEURISTIC ALGORITHM FOR THE RECTILINEAR STEINER MINIMAL TREE PROBLEM
Engineering Optimization, 1980
An O(n log n) algorithm for suboptimal rectilinear Steiner trees
IEEE Transactions on Circuits and Systems, 1979
The Rectilinear Steiner Tree Problem is $NP$-Complete
SIAM Journal on Applied Mathematics, 1977
On Steiner Minimal Trees with Rectilinear Distance
SIAM Journal on Applied Mathematics, 1976