An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Information Sciences: an International Journal
A computational study of a multiple-choice knapsack algorithm
ACM Transactions on Mathematical Software (TOMS)
A probabilistic model of information retrieval: development and comparative experiments
Information Processing and Management: an International Journal
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The dynamic programming method in the generalized traveling salesman problem
Mathematical and Computer Modelling: An International Journal
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
An interactive approach to route search
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Interactive route search in the presence of order constraints
Proceedings of the VLDB Endowment
Path branch points in mobile navigation
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
WISER: a web-based interactive route search system for smartphones
Proceedings of the 21st international conference companion on World Wide Web
Keyword-aware optimal route search
Proceedings of the VLDB Endowment
Interactive traffic-aware route search on smartphones
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Hi-index | 0.00 |
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via geographical entities that are relevant to the given terms. A route is effective if it does not exceed a given distance limit whereas the ranking scores of the visited entities, with respect to the search terms, are maximal. This paper introduces route-search queries, suggests three semantics for such queries and deals with the problem of efficiently answering queries under the different semantics. Since the problem of answering route-search queries is a generalization of the traveling salesman problem, it is unlikely to have an efficient solution, i.e., there is no polynomial-time algorithm that solves the problem (unless P=NP). Hence, in this work we consider heuristics for the problem. Methods for effectively computing routes are presented. The methods are compared analytically and experimentally. For these methods, experiments on both synthetic and real-world data illustrate their efficiency and their effectiveness in computing a route that satisfies the constraints of a route-search query.