In this paper, we consider the wireless sensor network in which the power of each sensor is
adjustable. Given a set of sensors and a set of targets, we study a problem of minimizing the …

We improve the running times of $ O (1) $-approximation algorithms for the set cover
problem in geometric settings, specifically, covering points by disks in the plane, or covering …

Abstract We introduce Appearance-MAT (AMAT), a generalization of the medial axis
transform for natural images, that is framed as a weighted geometric set cover problem. We …

We study geometric set cover problems in dynamic settings, allowing insertions and
deletions of points and objects. We present the first dynamic data structure that can maintain …

In this paper, we design the first polynomial time approximation schemes for the Set Cover
and Dominating Set problems when the underlying sets are non-piercing regions (which …

Assortment optimization is an important problem arising in many applications, including
retailing and online advertising. The goal in such problems is to determine a revenue-/profit …

We derive fast approximation schemes for LP relaxations of several well-studied geometric
optimization problems that include packing, covering, and mixed packing and covering …

Geometric set cover is a classical problem in computational geometry, which has been
extensively studied in the past. In the dynamic version of the problem, points and ranges …

This paper studies the minimum power partial multi-cover problem on a line (MinPowPMC-
Line), the goal of which is to find an assignment of powers to sensors such that at least a …

Given a hypergraph H=(X, S) H=(X, S), a planar support for HH is a planar graph G with
vertex set X, such that for each hyperedge S ∈ SS∈ S, the subgraph of G induced by the …