Crowdsourcing computing resources for shortest-path computation

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2012, Pages 434-437

  Efentakis, Alexandros ^a   Theodorakis, Dimitris ^b   Pfoser, Dieter ^a  

^a Research Center Athena   (Greece)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

crowdsourcing; graph separators; preprocessing; shortest path

Indexed keywords

COMPUTING LOAD; COMPUTING PLATFORM; COMPUTING RESOURCE; CROWDSOURCING; DATA COLLECTION; GRAPH SEPARATORS; IMPROVING PERFORMANCE; NAVIGATION SERVICE; PARALLELIZATIONS; PERFORMANCE STUDY; PRE-COMPUTATION; PREPROCESSING; RESEARCH CHALLENGES; ROAD NETWORK; ROAD NETWORK DATA; SCALABLE APPROACH; SHORTEST PATH; SHORTEST PATH ALGORITHMS;

GEOGRAPHIC INFORMATION SYSTEMS; MOTOR TRANSPORTATION;

GRAPH THEORY;

EID: 84872771817     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2424321.2424383     Document Type: Conference Paper

References (6)

1. D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable route planning. In Proceedings of the 10th international conference on Experimental algorithms, 2011.
2. C. Demetrescu, A. V. Goldberg, and D. Johnson. The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13-14, 2006. Proceedings. DIMACS Book 74. AMS , 2009.
3. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
4. A. Efentakis, D. Pfoser, and A. Voisard. Efficient data management in support of shortest-path computation. In Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science, CTS '11, pages 28-33, New York, NY, USA, 2011. ACM.
5. S. Jung and S. Pramanik. An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering, 14:1029-1046, 2002.
6. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20:359-392, December 1998.