Gui Citovsky

Learn More
Let P = {C1, C2, . . . , Cn} be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed to cover at most one point from each color class. We prove that the problems in this family are NP-complete (or NP-hard) and offer several constant-factor(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, d) and a set of subsets R = {R1, R2, ..., Rn} : Ri ⊆ X, the goal is to devise an ordering of the regions, σR, that the tour will visit such that when a single(More)
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 pair of nodedisjoint networks, one over the red points and one over the blue points. In this paper we consider our network structures to be spanning trees,(More)
We introduce an original application of Suprathreshold Stochastic Resonance (SSR). Given a noise-corrupted signal, we induce SSR in effort to filter the effect of the corrupting noise. This will yield a clearer version of the signal we desire to detect. We propose a financial application that can help forecast returns generated by big orders. We assume(More)
We consider the fundamental problem of scheduling data mules for managing a wireless sensor network. A data mule tours around a sensor network and can help with network maintenance such as data collection and battery recharging/replacement. We assume that each sensor has a fixed data generation rate and a capacity (upper bound on storage size). If the data(More)
  • 1