A Space Lower Bound for Name-Independent Compact Routing in Trees.

Kofi A. Laing Rajmohan Rajaraman

Published in: J. Interconnect. Networks (2007)

Keyphrases

lower bound
upper bound
binary trees
decision trees
low dimensional
compact representations
search space
tree models
objective function
high dimensional
np hard
shortest path
space time
vector space
branch and bound
branch and bound algorithm