Provably good global routing by a new approximation algorithm for multicommodity flow.

Christoph Albrecht

Published in: ISPD (2000)

Keyphrases

computational complexity
learning algorithm
routing problem
worst case
standard deviation
search strategy
np hard
multicommodity flow problems
multicommodity flow
tree structure
cost function
linear programming
multi objective
k means
search space
search algorithm
optimal solution