Geodesic
The hierarchical hub labeling is non-efficient
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2015), pp. 44-47

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{VMUMM_2015_5_a8,
     author = {R. A. Savchenko},
     title = {The hierarchical hub labeling is non-efficient},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {44--47},
     publisher = {mathdoc},
     number = {5},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2015_5_a8/}
}
TY  - JOUR
AU  - R. A. Savchenko
TI  - The hierarchical hub labeling is non-efficient
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2015
SP  - 44
EP  - 47
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2015_5_a8/
LA  - ru
ID  - VMUMM_2015_5_a8
ER  - 
%0 Journal Article
%A R. A. Savchenko
%T The hierarchical hub labeling is non-efficient
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2015
%P 44-47
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2015_5_a8/
%G ru
%F VMUMM_2015_5_a8
R. A. Savchenko. The hierarchical hub labeling is non-efficient. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2015), pp. 44-47. http://geodesic.mathdoc.fr/item/VMUMM_2015_5_a8/