Constrained shortest path computation

Lecture Notes in Computer Science

Volumn 3633, Issue , 2005, Pages 181-199

  Terrovitis, Manolis ^a   Bakiras, Spiridon ^b   Papadias, Dimitris ^b   Mouratidis, Kyriakos ^b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS;

DATA-PARTITIONING METHOD; EUCLEDEAN DISTANCE METHOD; SPATIAL DATABASES; SUB-OPTIMAL METHOD;

COMPUTATIONAL METHODS;

EID: 26444468924     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11535331_11     Document Type: Conference Paper

References (23)

1. Balas, E.: The prize collecting travelling salesman problem. Networks 19 (1989) 621-636
2. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD. (1990) 322-331
3. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD. (1984) 47-57
4. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD. (1995) 71-79
5. Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM TODS 24 (1999) 265-318
6. Papadias, D., Tao, Y., Mouratidis, K., Hui, C: Aggregate nearest neighbor queries in spatial databases. ACM TODS (2005, to appear)
7. Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik 1 (1959) 269-271
8. Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveller information system (ATIS). In: ICDE. (1993) 31-39
9. Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16 (1958) 87-90
10. Ford, L., Fukelson, D.: Flows in networks. Princeton University Press (1962)
11. Floyd, R.: Shortest path. Communications of the ACM 5 (1962) 345
12. Jung, S., Pramanik, S.: HiTi graph model of topographical roadmaps in navigation systems. In: ICDE. (1996) 76-84
13. Jing, N., Huang, Y., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE TKDE 10 (1998) 409-432
14. Jiang, B.: I/O-efficiency of shortest path algorithms: An analysis. In: ICDE. (1992) 12-19
15. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB. (2003) 802-813
16. Kolahdouzan, M.R., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB. (2004) 840-851
17. Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M: A road network embedding technique for k-nearest neighbor search in moving object databases. In: GIS. (2002) 94-100
18. Jensen, C.S., Kolárvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: GIS. (2003) 1-8
19. Shekhar, S., Yoo, J.S.: Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: GIS. (2003) 9-16
20. Yiu, M.L., Mamoulis, N.: Clustering objects on a spatial network. In: SIGMOD. (2004) 443-454
21. Huang, Y., Jing, N., Rundensteiner, E.A.: Integrated query processing strategies for spatial path queries. In: ICDE. (1997) 477-486
22. Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB. (2002) 287-298
23. Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.: Constrained nearest neighbor queries. In: SSTD. (2001) 257-278