Tight Linear Lower Memory Bound for Local Routing in Planar Digraphs.

Published in: CCCG (2012)

Keyphrases

upper bound
lower bound
worst case
generalization error bounds
linear functions
network topology
memory usage
routing algorithm
routing problem
equivalence classes
directed graph
error bounds
ad hoc networks
ground plane
vc dimension
linear systems
routing protocol
shortest path