On efficient \( k\)-optimal-location-selection query processing in metric spaces
From MaRDI portal
Publication:528666
DOI10.1016/j.ins.2014.11.038zbMath1360.68395OpenAlexW2030883263MaRDI QIDQ528666
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.11.038
metric spacesspatial databasequery processing\( k\)-optimal-location-selection queryoptimal location selection
Cites Work
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- Solving similarity joins and range queries in metric spaces with the list of twin clusters
- Nearest neighbor queries in metric spaces
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- A global optimization algorithm for target set selection problems
- Solving the \(k\)-influence region problem with the GPU
This page was built for publication: On efficient \( k\)-optimal-location-selection query processing in metric spaces