Author:
Gath Max,Herzog Otthein,Vaske Maximilian
Publisher
Springer International Publishing
Reference24 articles.
1. Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths in road networks. In: Experimental algorithms. 10th international symposium SEA 2011. Lecture notes in computer science, vol 6630. Springer, Berlin, pp 230–241
2. Abraham I, Delling D, Goldberg AV, Werneck RF (2012) Hierarchical hub labelings for shortest paths. In: Algorithms—ESA 2012. 20th Annual European symposium, Ljubljana, September 2012. Lecture notes in computer science, vol 7501. Springer, Berlin, pp 24–35
3. Batz GV, Delling D, Sanders P, Vetter C (2008) Time-dependent contraction hierarchies. In: Proceedings of the 11th workshop on algorithm engineering and experiments, New York
4. Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. In: Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University
5. Dijkstra EW (1959) A note on two problems in connexion with graphs. Num Math 1:269–271
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献