An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.

Dorothea Wagner Frank Wagner

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

Keyphrases

routing problem
worst case
depth first search
dynamic programming
cost function
computational complexity
genetic algorithm
optimal solution
data structure
lower bound
np hard
upper bound
linear programming
ant colony optimization
convergence rate