Location of Repository

Reverse facility location problems

By Sergio Cabello, J. Miguel Díaz-báñez, Stefan Langerman, Carlos Seara, Sergio Cabello, J. Miguel, Díaz-báñez Stefan Langerman, Carlos Seara and Inma Ventura

Abstract

The Reverse Nearest Neighbor (RNN) problem is to find all points in a given data set whose nearest neighbor is a given query point. Given a set of blue points and a set of red points, the bichromatic version of the RNN problem, for a query blue point, is to find all the red points whose blue nearest neighbour is the given query point. In this paper, we introduce and investigate optimization problems according to the Bichromatic Reverse Nearest Neighbor rule (BRNN). We give efficient algorithms to compute a new blue point such that: (1) the number of associated red points is maximum (MAXCOV criterion); (2) the maximum distance to the associated red points is minimum (MINMAX criterion); (3) the minimum distance to the associated red points is maximum (MAXMIN criterion). Our solutions use techniques from computational geometry, such as the concept of depth in an arrangement of disks or upper envelope of surface patches in three dimensions.

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.418.1122
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.imfm.si/preprinti/P... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.