Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Filtering search: a new approach to query answering
SIAM Journal on Computing
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Improved complexity bounds for center location problems on networks by using dynamic data structures
SIAM Journal on Discrete Mathematics
A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
A multiobjective model for locating undesirable facilities
Annals of Operations Research - Special issue on locational decisions
Computing the smallest k-enclosing circle and related problems
Computational Geometry: Theory and Applications
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Selection in monotone matrices and computing kth nearest neighbors
Journal of Algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Approximating a minimum Manhattan network
Nordic Journal of Computing
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
In this paper we consider several different problems of placing an obnoxious facility on geometric networks. In particular, our main results show how to obtain efficient polynomial time algorithms for locating an obnoxious facility on the given network under various distance functions such as maximizing the total sum of distances or maximizing the smallest of the distances from the facility to the nodes of the network. Our algorithms are obtained by applying concepts and techniques from Computational Geometry such as range searching, constructing spanners and other optimization schemes.