Parallel Bi-objective shortest paths using weight-balanced B-trees with bulk updates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8504 LNCS, Issue , 2014, Pages 111-122

  Erb, Stephan ^a   Kobitzsch, Moritz ^a   Sanders, Peter ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GRAPH THEORY;

B TREES; BI OBJECTIVES; CONSTANT FACTORS; OBJECTIVE FUNCTIONS; PRIORITY QUEUES; SEARCH TREES; SEQUENTIAL ALGORITHM; SHORTEST PATH;

ALGORITHMS;

EID: 84903713663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07959-2_10     Document Type: Conference Paper

References (22)

1. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230-241. Springer, Heidelberg (2011)
2. Achakeev, D., Seeger, B.: Efficient bulk updates on multiversion B-trees. PVLDB 6(14), 1834-1845 (2013)
3. Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. Comput. 32(6), 1488-1508 (2003)
4. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73, 129-174 (1996)
5. Erb, S.: Engineering Parallel Bi-Criteria Shortest Path Search. Master's thesis. Karlsruhe Institute of Technology (2013)
6. Frias, L., Singler, J.: Parallelization of bulk operations for STL dictionaries. In: Bougé, L., Forsell, M., Träff, J.L., Streit, A., Ziegler, W., Alexander, M., Childs, S. (eds.) Euro-Par Workshops 2007. LNCS, vol. 4854, pp. 49-58. Springer, Heidelberg (2008) (Pubitemid 351464925)
7. Guerriero, F., Musmanno, R.: Label correcting methods to solve multicriteria shortest path problems. J. Optim. Theory Appl. 111(3), 589-613 (2001)
8. + -trees. In: Harchol-Balter, M., Douceur, J.R., Xu, J. (eds.) SIGMETRICS, pp. 283-294. ACM Press, New York (2003)
9. Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Application. LNEMS, vol. 177, pp. 109-127. Springer, Berlin (1980)
10. Iori, M., Martello, S., Pretolani, D.: An aggregate label setting policy for the multiobjective shortest path problem. Eur. J. Oper. Res. 207(3), 1489-1496 (2010)
11. Levandoski, J.J., Lomet, D.B., Sengupta, S.: The Bw-tree: A B-tree for new hardware platforms. In: Jensen, C.S., Jermaine, C.M., Zhou, X. (eds.) ICDE, pp. 302-313. IEEE Computer Society, Washington (2013)
12. Machuca, E., Mandow, L.: Multiobjective heuristic search in road maps. Expert Syst. Appl. 39(7), 6435-6445 (2012)
13. Martins, E.: On a multicriteria shortest path problem. Eur. J Oper. Res. 16(2), 236-245 (1984)
14. Meyer, U., Sanders, P.: Δ-stepping: A parallelizable shortest path algorithm. J. Algorithms 49(1), 114-152 (2003)
15. Paixáo, J.M., Santos, J.: Labeling methods for the general case of the multi-objective shortest path problem - -A computational study. In: Madureira, A., Reis, C., Marques, V. (eds.) Computational Intelligence and Decision Making, Intell. Syst. Control Autom. Sci. Eng., vol. 61, pp. 489-502. Springer, Dordrecht (2013)
16. Raith, A.: Speed-up of labelling algorithms for biobjective shortest path problems. In: Ehrgott, M., Mason, A., O'Sullivan, M., Raith, A., Walker, C., Zakeri, G. (eds.) ORSNZ, pp. 313-322. Operations Research Society of New Zealand, Auckland (2010)
17. Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Computers & OR 36(4), 1299-1331 (2009)
18. Saikkonen, R.: Bulk Updates and Cache Sensitivity in Search Trees. Ph.D. thesis. University of Jyväskylä (2009)
19. Sanders, P., Mandow, L.: Parallel label-setting multi-objective shortest path search. In: IPDPS, pp. 215-224. IEEE Computer Society, Washington (2013)
20. Schieferdecker, D., Völker, M., Wagner, D.: Efficient algorithms for distributed detection of holes and boundaries in wireless networks. CoRR abs/1103.1771 (2011)
21. Sewall, J., Chhugani, J., Kim, C., Satish, N., Dubey, P.: PALM: Parallel architecture-friendly latch-free modifications to B+ trees on many-core processors. PVLDB 4(11), 795-806 (2011)
22. Tung, C.T., Chew, K.L.: A multicriteria Pareto-optimal path algorithm. Eur. J. Oper. Res. 62(2), 203-209 (1992)