Skip to main content

Trip Planning Queries in Road Network Databases

  • Reference work entry
Book cover Encyclopedia of GIS

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Arora, S.: Polynomial-Time Approximation Schemes for Euclidean TSP and other Geometric Problems. J. ACM 45(5), 753–782 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time-Windows. In: Proc. of FOCS (2004)

    Google Scholar 

  3. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Computer Science Department, CMU (1976)

    Google Scholar 

  4. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. The MIT Press (1997)

    Google Scholar 

  5. Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for tsp with neighborhoods in the plane. In: SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp. 38–46 (2001)

    Google Scholar 

  6. Garg, N., Konjevod, G., Ravi, R.: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. In: Proc. of SODA (1998)

    Google Scholar 

  7. Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng., S.-H.: On trip planning queries in spatial databases. In: SSTD: Proc. of the International Symposium on Advances in Spatial and Temporal Databases, pp. 273–290 (2005)

    Google Scholar 

  8. Ma, X., Shekhar, S., Xiong, H., Zhang, P.: Exploiting a page-level upper bound for multi-type nearest neighbor queries. In: ACM GIS, pp. 179–186 (2006)

    Google Scholar 

  9. Myung, Y., Lee, C., Tcha, D.: On the Generalized Minimum Spanning Tree Problem. Networks (1995)

    Google Scholar 

  10. Papadias, D., Zhang, J., Mamoulis, N., Taom, Y.: Query Processing in Spatial Network Databases. In: Proc. of VLDB (2003)

    Google Scholar 

  11. Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The Optimal Sequenced Route Query. VLDB Journal (2007)

    Google Scholar 

  12. Shekhar, S., Liu, D.: CCAM: A connectivity/clustered access method for networks and network computations. IEEE TKDE 19(1), 102–119 (1997)

    Article  Google Scholar 

  13. TSP Home Web Site. http://www.tsp.gatech.edu/

  14. Yiu, M., Mamoulis, N.: Clustering Objects on a Spatial Network. In: Proc. of SIGMOD (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Li, F., Hadjieleftheriou, M., Kollios, G., Cheng, D., Teng, SH. (2008). Trip Planning Queries in Road Network Databases. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_1416

Download citation

Publish with us

Policies and ethics