We consider several variants of a basic resource replication problem in this paper, and propose new approximation results for them. These problems are of fundamental interest in th...
We study the following separation problem: Given n connected curves and two points s and t in the plane, compute the minimum number of curves one needs to retain so that any path ...
We study the problem of designing a data structure that reports the positions of the distinct τ-majorities within any range of an array A[1, n], without storing A. A τ-majority ...