Approximate Weighted Farthest Neighbors and Minimum Dilation Stars

Details Approximate Weighted Farthest Neighbors and Minimum Dilation Stars Approximate Weighted Farthest Neighbors and Minimum Dilation Stars

2006-02-07

arxiv.org/abs/cs/0602029v1

Computer Science

Computational Geometry

12 pages, 2 figures

Scientific paper

We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our techniques with core-sets for approximate unweighted farthest neighbors, we show how to find (1+epsilon)-approximate farthest neighbors in time O(log n) per query in D-dimensional Euclidean space for any constants D and epsilon. As an application, we find an O(n log n) expected time algorithm for choosing the center of a star topology network connecting a given set of points, so as to approximately minimize the maximum dilation between any pair of points.

Affiliated with

Also associated with

No associations

Rating

Approximate Weighted Farthest Neighbors and Minimum Dilation Stars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Weighted Farthest Neighbors and Minimum Dilation Stars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Weighted Farthest Neighbors and Minimum Dilation Stars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-698190