Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI.

András Recski Dávid Szeszlér

Published in: Discret. Appl. Math. (2007)

Keyphrases

steiner tree
shortest path
minimum spanning tree
routing algorithm
undirected graph
facility location
edge weights
routing problem
linear programming relaxation
minimum length
search space
mathematical model
complex networks