Login / Signup

An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle.

James P. CohoonDana S. RichardsJeffrey S. Salowe
Published in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1990)
Keyphrases
  • dynamic programming
  • optimal solution
  • steiner tree
  • worst case
  • objective function
  • np hard
  • search space
  • segmentation algorithm
  • mathematical model
  • convex hull