Login / Signup

An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing.

Michael KaufmannShaodi GaoKrishnaiyan Thulasiraman
Published in: J. Circuits Syst. Comput. (1996)
Keyphrases
  • minimum spanning tree
  • computational complexity
  • dynamic programming
  • steiner tree
  • worst case
  • np hard
  • linear programming
  • segmentation algorithm
  • graph structure
  • evolutionary algorithm
  • cost function
  • undirected graph