Login / Signup

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

Andrew B. KahngGabriel Robins
Published in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1992)
Keyphrases
  • arbitrary dimension
  • steiner tree
  • higher dimensional
  • lower bound
  • upper bound
  • shortest path