Parallel label-setting multi-objective shortest path search

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium, IPDPS 2013

Volumn , Issue , 2013, Pages 215-224

  Sanders, Peter ^a   Mandow, Lawrence ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

graph algorithm; multicriteria; shortest paths

Indexed keywords

GRAPH ALGORITHMS; MULTI-CRITERIA; OBJECTIVE FUNCTIONS; PARETO OPTIMAL PATHS; PRIORITY QUEUES; SEQUENTIAL ALGORITHM; SHORTEST PATH; SHORTEST PATH SEARCHES;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; OPTIMIZATION;

GRAPH THEORY;

EID: 84884873462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2013.89     Document Type: Conference Paper

References (24)

1. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. In Foundations of Computer Science, pages 356-368, Santa Fe, NM, 20-22 November, 1994. IEEE, Los Alamitos, CA.
2. G. S. Brodal, R. Fagerberg, and C. N. S. Pedersen. Computing the quartet distance between evolutionary trees in time O (n log n). Algorithmica, 38(2):377-395, 2003. (Pubitemid 40871692)
3. G. S. Brodal, J. L. Träff, and C. D. Zaroliagis. A parallel priority queue with constant time operations. J. of Par. and Distr. Comp., 49(1):4-21, 25 Feb. 1998.
4. G. S. Brodal and K. Tsakalidis. Dynamic planar range maxima queries. In ICALP, volume 6755 of LNCS, pages 256-267. Springer, 2011.
5. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest path algorithms: Theory and experimental evaluation. Mathematical Programming, 73:129-174, 1996. (Pubitemid 126375469)
6. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra's shortest path algorithm. In 23rd MFCS, number 1450 in LNCS, pages 722-731. Springer, 1998.
7. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra's shortest path algorithm. In 23rd Symposium on Mathematical Foundations of Computer Science, number 1450 in LNCS, pages 722-731, Brno, Czech Republic, 1998. Springer.
8. L. Frias and J. Singler. Parallelization of bulk operations for STL dictionaries. In Euro-Par Workshops, volume 4854 of LNCS, pages 49-58. Springer, 2007. (Pubitemid 351464925)
9. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman and Company, New York, 1979.
10. F. Guerriero and R. Musmanno. Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications, 111(3):589-613, 2001. (Pubitemid 33383508)
11. L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation for linear lists. In 9th ACM Symposium on Theory of Computing, pages 49-60. ACM, 1977.
12. L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In 19th IEEE FOCS, pages 8-21, 1978.
13. P. Hansen. Bicriterion path problems. In Multiple Criteria Decision Making Theory and Application, volume 177 of LNEMS, pages 109-127. Springer, 1980.
14. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin/Cummings, 1994.
15. E. Machuca, L. Mandow, J. L. Pérez de la Cruz, and A. Ruiz-Sepúlveda. A comparison of heuristic best-first algorithms for bicriterion shortest path problems. European Journal of Operational Research, 217:44-53, 2012.
16. L. Mandow and J. L. Pérez de la Cruz. Multiobjective A* Search with Consistent Heuristics. Journal of the ACM, 57(5):27:1-25, 2010.
17. E. Martins. On a multicriteria shortest path problem. European Journal of Operational Research, 16(2):236-245, 1984.
18. K. Mehlhorn and P. Sanders. Algorithms and Data Structures - The Basic Toolbox. Springer, 2008.
19. U. Meyer and P. Sanders. Δ-stepping: A parallelizable shortest path algorithm. Journal of Algorithms, 49(1):114-152, 2003.
20. M. Müller-Hannemann and K. Weihe. On the cardinality of the Pareto set in bicriteria shortest path problems. Annals OR, 147(1):269-286, 2006. (Pubitemid 44496810)
21. J. M. Paixão and J. L. Santos. Labelling methods for the general case of the multi-objective shortest path problem - a computational study. Technical Report DMUC. 07-42, Centro de Matemática da Universidade de Coimbra, 2007.
22. A. Raith and M. Ehrgott. A comparison of solution strategies for biobjective shortest path problems. Computers & Operations Research, 36(4):1299-1331, 2009.
23. A. J. V. Skriver. A classification of bicriterion shortest path (BSP) algorithms. Asia Pacific Journal Of Operational Research, 17(2):199-212, 2000.
24. C. T. Tung and K. L. Chew. A multicriteria Pareto-optimal path algorithm. European Journal of Operational Research, 62(2):203-209, 1992.