Reverse facility location problems

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 68-71

  Cabello, Sergio ^a   Díaz Báñez, J Miguel ^b   Langerman, Stefan ^c   Seara, Carlos ^d   Ventura, Inma ^e  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

^b UNIVERSITY OF SEVILLE   (Spain)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^e UNIVERSITY OF HUELVA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85011838681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. P.K. Agarwal, O. Schwarzkopf, M. Sharir. The overlay of lower envelopes and its applications. Discrete Comput. Geom., 15, 1996, pp. 1-13.
2. H.-K. Ahn, S.-W. Cheng, O. Cheong, M. Golin, R. van Oostrum. Competitive facility location: The Voronoi game. Theoretical Comp. Sci., 310, 2004, pp. 457-467.
3. B. Aronov, S. Har-Peled. On approximating the depth and related problems. SODA, 2005.
4. R. Benetis, C.S. Jensen, G. Karčiauskas, S. Šaltenis. Nearest neighbor and reverse nearest neighbor queries for moving objects. Symposium on Database Engineering & Applications, 2002, pp. 44-53.
5. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir. Arrangements of curves in the plane-topology, combinatorics, and algorithms. Theoretical Comp. Sci., 92, 1992, pp. 319-336.
6. H. Edelsbrunner, L. Guibas, M. Sharir. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete Comput. Geom., 4, 1989, pp. 311-336.
7. A. Gajentaan, M.H. Overmars. On a class of O(n2) problems in computational geometry. Comput. Geom. Theory and Applications, 5, 1995, pp. 165-185.
8. H. Imai, T. Asano. Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms, 4, 1983, pp. 310-323.
9. K. Kedem, R. Livne, J. Pach, M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1, 1986, pp. 59-71.
10. F. Korn, S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. International Conference on Management of Data, SIGMOD, Vol. 29.2, 2000, pp. 201-212.
11. F. Korn, S. Muthukrishnan, D. Srivastava. Reverse nearest neighbor aggregates over data streams. 28th VLDB Conference, 2002.
12. A.Maheshwari, J. Vahrenhold, N. Zeh. On reverse nearest nighbor queries. CCCG'02, 2002.
13. M. Sharir, P.K. Agarwal. Davenport-Schinzel sequences and their geometric applications, Cambridge University Press, 1995.
14. A. Singh, H. Ferhatosmanoglu, A. Aman Tosun. High dimensional reverse nearest neighbor queries. International Conference on Information and Knowledge Management, 2003, pp. 91-98.
15. M. Smid. Closest point problems in computational geometry. Handbook on Computational Geometry, Elsevier, 1997.
16. Y. Tao, D. Papadias, X. Lian. Reverse kNN search in arbitrary dimensionality. 30th VLDB Conference, 2004.
17. G.T. Toussaint. Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining. International Journal of Computational Geometry and Applications, Vol. 15, No. 2, 2005, pp. 101-150.