Abstract
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 approximate farthest neighbors that are farther than a factor (1 − ε) of optimal in time O(logn) per query in D-dimensional Euclidean space for any constants D and ε. As an application, we find an O(n logn) 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. MSRI Publications, vol. 52, pp. 1–30. Cambridge University Press, Cambridge (2005)
Arya, S., Mount, D.: Computational geometry: Proximity and location. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications, pp. 63-1–63-22. CRC Press, Boca Raton (2005)
Chan, T.M.: Faster core-set constructions and data stream algorithms in fixed dimensions. In: Proc. 20th Symp. Computational Geometry, pp. 152–159. ACM Press, New York (2004)
Duncan, C., Goodrich, M.T.: Approximate geometric query structures. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications, pp. 26-1–26-17. CRC Press, Boca Raton (2005)
Eppstein, D., Wortman, K.A.: Minimum dilation stars. In: Proc. 21st Symp. Computational Geometry, pp. 321–326. ACM Press, New York (June 2005)
Lee, D.T., Wu, V.B.: Multiplicative weighted farthest neighbor Voronoi diagrams in the plane. In: Proceedings of the International Workshop on Discrete Mathematics and Algorithms, pp. 154–168 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Augustine, J., Eppstein, D., Wortman, K.A. (2010). Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-14031-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14030-3
Online ISBN: 978-3-642-14031-0
eBook Packages: Computer ScienceComputer Science (R0)