We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...