Geometric data summarization has become an essential tool in both geometric
approximation algorithms and where geometry intersects with big data problems. In linear or …

The emergence and convergence of information and communication technologies (ICTs)
are fundamentally transforming the use of technology, and in particular concerning the …

We consider the problem of computing minimum geometric hitting sets in which, given a set
of geometric objects and a set of points, the goal is to compute the smallest subset of points …

We present approximation algorithms for maximum independent set of pseudo-disks in the
plane, both in the weighted and unweighted cases. For the unweighted case, we prove that …

Quantitative methods and techniques from operations research (OR) are well-accepted in
many industries, eg the manufacturing industry or the transportation industry. Similarly …

We prove that active learning provides an exponential improvement over PAC (passive)
learning of homogeneous linear separators under nearly log-concave distributions. Building …

In this paper, we present approximation algorithms for minimum vertex and edge guard
problems for polygons with or without holes with a total of n vertices. For simple polygons …

In this paper, we study deployment patterns to achieve full coverage and k-connectivity (k≤
6) under different ratios of the sensor communication range (denoted by R c) to the sensing …

We show the existence of ε-nets of size O (1/ε log log 1/ε) for planar point sets and axis-
parallel rectangular ranges. The same bound holds for points in the plane with" fat" …

The minimum-weight set cover problem is widely known to be O (log n)-approximable, with
no improvement possible in the general case. We take the approach of exploiting problem …