Finding influential location regions based on reverse k-neighbor queries

Full Text
Finding-influential-location.pdf embargoed access
Request a copy
When filling the form you are requesting a copy of the article, that is deposited in the institutional repository (DUGiDocs), at the autor or main autor of the article. It will be the same author who decides to give a copy of the document to the person who requests it, if it considers it appropriate. In any case, the UdG Library doesn’t take part in this process because it is not authorized to provide restricted articles.
In this paper we introduce and solve several problems that arise in the single facility location field. A reverse k-influential location problem finds a region such that the location of a new facility, desirable or obnoxious, in the region guarantees a minimum k-influential value associated to the importance, attractiveness or repulsiveness, of the facility as a solution to a reverse k-nearest or farthest neighbor query. Solving reverse k-influential location problems help decision makers to progress towards suitable locations for a new facility. We present a parallel approach, to be ran on a graphics processing unit, for approximately solving reverse k-influential location problems, and also provide and discuss experimental results showing the efficiency and scalability of our approach ​
​Tots els drets reservats