Login / Signup

3-Step Rectilinear Minimum Spanning Tree Construction for Obstacle-Avoiding Component-to-Component Routing.

Emilio Wuerges
Published in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2020)
Keyphrases
  • minimum spanning tree
  • spanning tree
  • probabilistic model
  • upper bound
  • shortest path
  • traveling salesman problem