Distributed time-dependent contraction hierarchies

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

Volumn 6049 LNCS, Issue , 2010, Pages 94-105

  Kieritz, Tim ^a   Luxen, Dennis ^a   Sanders, Peter ^a   Vetter, Christian ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Algorithm engineering; Distributed computation; Message passing; Time dependent shortest paths

Indexed keywords

ALGORITHM ENGINEERING; CURRENT TECHNIQUES; DETAILED MODELS; DISTRIBUTED COMPUTATIONS; DISTRIBUTED MEMORY; DISTRIBUTED TIME; GERMANY; GLOBAL INTERNET; MEDIUM SIZE; MEMORY CONSUMPTION; PARALLELIZATIONS; QUERY SERVERS; ROAD NETWORK; ROUTE PLANNING; SERVER-BASED; TIME-DEPENDENT; TIME-DEPENDENT SHORTEST PATHS; TRAFFIC SITUATIONS; TRAVEL TIME;

ALGORITHMS; GRAPH THEORY; HIGHWAY PLANNING; MOTOR TRANSPORTATION; OPERATIONS RESEARCH;

MESSAGE PASSING;

EID: 78650671571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_9     Document Type: Conference Paper

References (30)

1. Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discr. Algorithms 2(1), 53-86 (2004).
2. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85-96. Springer, Heidelberg (1985).
3. Brisaboa, N., Ladra, S., Navarro, G.: Directly addressable variable-length codes. In: Hyyro, H. (ed.) SPIRE 2009. LNCS, vol. 5721, pp. 122-130. Springer, Heidelberg (2009).
4. Claude, F., Navarro, G.: Practical rank/Select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176-187. Springer, Heidelberg (2008).
5. Ferragina, P., González, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. ACM J. Exp. Algor. 13, article 12 (2009).
6. Ferragina, P., Manzini, G., M̈akinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2), article 20 (2007).
7. Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459-470. Springer, Heidelberg (2007).
8. Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comp. Sci. 410(51), 5354-5364 (2009).
9. Geary, R., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comp. Sci. 368, 231-246 (2006).
10. González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Proc. 4th WEA (posters), pp. 27-38 (2005).
11. González, R., Navarro, G.: Compressed text indexes with fast locate. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 216-227. Springer, Heidelberg (2007).
12. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997).
13. Kärkkäinen, J., Manzini, G., Puglisi, S.J.: Permuted longest-common-prefix array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 181-192. Springer, Heidelberg (2009).
14. Kurtz, S.: Reducing the space requirements of suffix trees. Soft. Pract. Exp. 29(13), 1149-1171 (1999).
15. Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proc. of the IEEE 88(11), 1722-1732 (2000).
16. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic J. Comp. 12(1), 40-66 (2005).
17. Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. SIAM J. Comp., 935-948 (1993).
18. McCreight, E.: A space-economical suffix tree construction algorithm. J. ACM 32(2), 262-272 (1976).
19. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996).
20. Munro, I., Raman, V., Rao, S.: Space efficient suffix trees. J. Algor. 39(2), 205-222 (2001).
21. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comp. Surv. 39(1), article 2 (2007).
22. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. 9th ALENEX (2007).
23. Puglisi, S., Turpin, A.: Space-time tradeoffs for longest-common-prefix array computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 124-135. Springer, Heidelberg (2008).
24. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233-242 (2002).
25. Russo, L., Navarro, G., Oliveira, A.: Fully-Compressed Suffix Trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 362-373. Springer, Heidelberg (2008).
26. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. Algor. 48(2), 294-313 (2003).
27. Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys. 41(4), 589-607 (2007).
28. Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proc. 21st SODA, pp. 134-149 (2010).
29. Välimäki, N., Gerlach, W., Dixit, K., Mäkinen, V.: Engineering a compressed suffix tree implementation. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 217-228. Springer, Heidelberg (2007).
30. Weiner, P.: Linear pattern matching algorithms. In: IEEE Symp. Swit. and Aut. Theo., pp. 1-11 (1973).