Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
The multi-rule partial sequenced route query
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Heuristic algorithms for route-search queries over geographical data
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
An interactive approach to route search
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
A large-scale study on map search logs
ACM Transactions on the Web (TWEB)
Travel route recommendation using geotags in photo sharing sites
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Photo2Trip: generating travel routes from geo-tagged photos for trip planning
Proceedings of the international conference on Multimedia
Interactive route search in the presence of order constraints
Proceedings of the VLDB Endowment
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Smart itinerary recommendation based on user-generated GPS trajectories
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A continuous query system for dynamic route planning
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Interactive itinerary planning
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Discovering popular routes from trajectories
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Trip-Mine: An Efficient Trip Planning Approach with Travel Time Constraints
MDM '11 Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management - Volume 01
Multi-approximate-keyword routing in GIS data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
The dynamic programming method in the generalized traveling salesman problem
Mathematical and Computer Modelling: An International Journal
Top-K nearest keyword search on large graphs
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Identifying a preferable route is an important problem that finds applications in map services. When a user plans a trip within a city, the user may want to find "a most popular route such that it passes by shopping mall, restaurant, and pub, and the travel time to and from his hotel is within 4 hours." However, none of the algorithms in the existing work on route planning can be used to answer such queries. Motivated by this, we define the problem of keyword-aware optimal route query, denoted by KOR, which is to find an optimal route such that it covers a set of user-specified keywords, a specified budget constraint is satisfied, and an objective score of the route is optimal. The problem of answering KOR queries is NP-hard. We devise an approximation algorithm OSScaling with provable approximation bounds. Based on this algorithm, another more efficient approximation algorithm BucketBound is proposed. We also design a greedy approximation algorithm. Results of empirical studies show that all the proposed algorithms are capable of answering KOR queries efficiently, while the BucketBound and Greedy algorithms run faster. The empirical studies also offer insight into the accuracy of the proposed algorithms.