Machine Learning for Combinatorial Resource Allocation
Summary
Finding Small Rectilinear Steiner Minimal Trees Quickly. VLSI routing optimization using search with pruning. Initial transformation to Hanan grid, then branch-and-bound search. Handles up to 14 terminals efficiently.
Themes
Keywords
Steiner trees, VLSI routing, optimization, branch-and-bound, rectilinear
Poster
Click image to open full size