Inefficiency of a hierarchical hub system
We study the shortest path problem in a graph using hub labeling. It is proved that a hierarchical hub labeling can be $\Omega(\sqrt n)$ times larger than the minimal (non-hierarchical) hub labeling.