Learn More
Given a set of points P ⊂ R and value > 0, an core-set S ⊂ P has the property that the smallest ball containing S is within of the smallest ball containing P . This paper shows that any point set has an -core-set of size d1/ e, and this bound is tight in the worst case. A faster algorithm given here finds an core-set of size at most 2/ . These results imply(More)
Given a set of points <i>P</i> &sub; <i>R</i><sup><i>d</i></sup> and value &#8714; &gt; 0, an &#8714;-core-set <i>S</i> &sub; <i>P</i> has the property that the smallest ball containing <i>S</i> is an &#8714;-approximation of the smallest ball containing <i>P</i>. This paper shows that any point-set has an &#8714;-core-set of size [2/&#8714;]. We also give(More)
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion embeddings have recently found numerous applications in computer science.Most of the known embedding results are "absolute",that is, of the form: any metric <i>Y</i> from a given(More)
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. Among other results, we give an <i>O</i>(&radic;<i>n</i>)-approximation algorithm for the problem of finding a line embedding of a metric induced by a given unweighted graph, that minimizes the (standard) multiplicative(More)
We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w(y) distinct elements have been accessed since the last access to element y, and d(x, y) denotes the(More)
We consider the problem of embedding general metrics into trees. We give the first non-trivial approximation algorithm for minimizing the multiplicative distortion. Our algorithm produces an embedding with distortion (<i>c</i> log <i>n</i>)<sup><i>O</i>(&radic;log &#916;)</sup>, where <i>c</i> is the optimal distortion, and &#916; is the spread of the(More)
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information about its geometry (e.g., distances, angles, and/or orientations), and the goal is to reconstruct the global geometry from this partial information. More precisely, we are given a(More)