vlsi layout-3


ONLINE TRAINING EDUREKA

On exact solutions to the Euclidean bottleneck Steiner tree problem

FREE-DOWNLOAD [PDF] SW Bae, C Lee… – Information Processing Letters, 2010
tree where the maximum of the edge lengths is minimized and the Steiner points in the resulting
tree can be chosen in the whole plane R 2 . The classical and the bottleneck Steiner tree problems,
and their variations, have some known applications in VLSI layout, multi 




IEEE PAPER UNITED STATES