The hierarchical hub labeling is non-efficient
Ruslan Savchenko · Moscow University Mathematics Bulletin · 2015
The shortest path problem in a graph is studied using hub labeling. It is proved that a hierarchical hub labeling can be $\Omega \left( {\sqrt n } \right)$ times larger than the minimal (non-hierarchical) hub labeling.