A MapReduce-based approach for shortest path problem in large-scale networks

S. Aridhi; Philippe Lacomme; L. Ren; B. Vincent

Journal Articles Engineering Applications of Artificial Intelligence Year : 2015

A MapReduce-based approach for shortest path problem in large-scale networks

, (1) , ,

1

S. Aridhi

Function : Author

Philippe Lacomme

Function : Author
PersonId : 173803
IdHAL : philippe-lacomme
ORCID : 0000-0001-6328-9479
IdRef : 111478707

Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

CV

L. Ren

Function : Author

B. Vincent

Function : Author
PersonId : 18280
IdHAL : benjamin-vincent
ORCID : 0000-0001-5420-6002

Domains

Operations Research [math.OC]

Bastien DOREAU : Connect in order to contact the contributor

https://hal.science/hal-02081905

Submitted on : Wednesday, March 27, 2019-8:54:18 PM

Last modification on : Saturday, April 22, 2023-4:30:42 AM

Dates and versions

hal-02081905 , version 1 (27-03-2019)

Identifiers

HAL Id : hal-02081905 , version 1

Cite

S. Aridhi, Philippe Lacomme, L. Ren, B. Vincent. A MapReduce-based approach for shortest path problem in large-scale networks. Engineering Applications of Artificial Intelligence, 2015, 41, pp.151-165. ⟨hal-02081905⟩

A MapReduce-based approach for shortest path problem in large-scale networks

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share