DIKUL - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Reverse facility location problems
    Cabello, Sergio ...
    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 ▫$S$▫ of two different colors (blue and red), the ... bi-chromatic version of (RNN) query consists of a point in one of the categories, say blue, and must determine the red points for which the query point is the closest blue point. In this paper, we introduce and investigate some optimization problems according to the Bi-chromatic Reverse Nearest Neighbor rule (BRNN). We give efficient algorithm to compute a new blue point, such that: (i) the number of associated red points is maximum (MAXCOV); (ii) the maximum distance to the associated red points is minimum (MINMAX); (iii) the maximum distance to the associated red points is maximum (MAXMIN).
    Vir: 17th Canadian Conference on Computational Geometry : August 10-12, 2005, University of Windsor [Elektronski vir] (4 str.)
    Vrsta gradiva - prispevek na konferenci
    Leto - 2005
    Jezik - angleški
    COBISS.SI-ID - 13769049

    Povezava(-e):

    http://www.cccg.ca/proceedings/2005/24.pdf

Vnos na polico