A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem
- 11 July 2019
- book chapter
- Published by Springer Nature
- p. 440-448
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Spatial keyword query processingProceedings of the VLDB Endowment, 2013
- A measure & conquer approach for the analysis of exact algorithmsJournal of the ACM, 2009
- Efficient retrieval of the top-k most relevant spatial web objectsProceedings of the VLDB Endowment, 2009
- Keyword Search on Spatial Databases2008
- Modeling Team Member Characteristics for the Formation of a Multifunctional Team in Concurrent EngineeringIEEE Transactions on Engineering Management, 2004
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- Closest pair queries in spatial databasesACM SIGMOD Record, 2000
- Distance browsing in spatial databasesACM Transactions on Database Systems, 1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Incremental distance join algorithms for spatial databasesACM SIGMOD Record, 1998