We develop simple and general techniques to obtain faster (near-linear time) static
approximation algorithms, as well as efficient dynamic data structures, for four fundamental …

Wireless sensor networks have recently posed many new system building challenges. One
of the main problems is energy conservation since most of the sensors are devices with …

We improve several existing algorithms for determining the location of one or more
undesirable facilities amidst a set P of n demand points, under various constraints and …

Given are a finite set of points P and a compact polygonal set S in R2. The problem is to
locate two new facilities in S, maximizing the minimum of all weighted distances between the …

The traditional problems of facility location are defined statically; a set (or multiset) of n
points is given as input, corresponding to the positions of clients, and a solution is returned …

Let S be a set of n points in three-dimensional Euclidean space. We consider the problem of
positioning a plane π intersecting the convex hull of S such that min {d (π, p); p∈ S} is …

VC-dimension and $\varepsilon $-nets are key concepts in Statistical Learning Theory.
Intuitively, VC-dimension is a measure of the size of a class of sets. The famous $\varepsilon …

This paper deals with the problem of locating a maximal cardinality set of obnoxious facilities
within a bounded rectangle in the plane such that their pairwise L∞-distance as well as the …

Wireless sensor networks have recently posed many new system building challenges. One
of the main problems is energy conservation since most of the sensors are devices with …

The dispersion problem has been widely studied in computational geometry and facility
location and is closely related to the packing problem. The goal is to locate n points (eg …