A space lower bound for name-independent compact routing in trees.

Kofi A. Laing Rajmohan Rajaraman

Published in: SPAA (2005)

Keyphrases

lower bound
upper bound
optimal solution
routing problem
binary trees
compact representations
worst case
routing protocol
branch and bound
branch and bound algorithm
lower and upper bounds
decision trees
tree structure
routing algorithm
shortest path
np hard
objective function