Being a Ph.D student I've spent a lot of time optimizing Cohen et al. algorithm for the 2-hop cover (Hub Labels). Finally we published our results at Syphosium of Experimental Algorithms:
Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, and Renato F. Werneck. Hub Labels: Theory and Practice
After the talk I reimplemented the Hub Labeling approximation algorithm from scratch and published it: https://github.com/savrus/hl
Also, in 2014 we solved some theoretical problems related to Hub Labels including NP-hardness of the minimum Hub Labeling problem and approximation guarantee for Hierarchical Hub Labeling greedy algorithms. The preprint is available from arXiv: http://arxiv.org/abs/1501.02492
That's it for 2014, that's it.
Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, and Renato F. Werneck. Hub Labels: Theory and Practice
After the talk I reimplemented the Hub Labeling approximation algorithm from scratch and published it: https://github.com/savrus/hl
Also, in 2014 we solved some theoretical problems related to Hub Labels including NP-hardness of the minimum Hub Labeling problem and approximation guarantee for Hierarchical Hub Labeling greedy algorithms. The preprint is available from arXiv: http://arxiv.org/abs/1501.02492
That's it for 2014, that's it.
