Given n pairs of points, S = {{p1, q1}, {p2, q2}, . . . , {pn, qn}}, in some metric space, we study the problem of two-coloring the points within each pair, red and blue, to optimize the cost of aâ€¦ (More)

The skip list is an elegant dictionary data structure that is commonly deployed in RAM. A skip list with <i>N</i> elements supports searches, inserts, and deletes in <i>O</i>(log <i>N</i>) operationsâ€¦ (More)

In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with point-locational-uncertainty which we will call the adversarial TSP problem (ATSP). Given a metric space (X,â€¦ (More)

In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with point-locational-uncertainty which we will call the adversarial TSP problem (ATSP). Given a metric space (X,â€¦ (More)

IEEE INFOCOM 2017 - IEEE Conference on Computerâ€¦

2017

In this paper we study the following problem: given a set of m sensors that collectively cover a set of n target points with heterogeneous coverage requirements (target j needs to be covered every fjâ€¦ (More)