Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Randomization and Approximation Techniques in Computer Science

International Workshop on Approximation Algorithms for Combinatorial Optimization

RANDOM 2010, APPROX 2010: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques pp 192–204Cite as

Proximity Algorithms for Nearly-Doubling Spaces

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6302))

Abstract

We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d *, remove from S the fewest number of points so that the remaining set has doubling dimension at most d *. We present a bicriteria approximation for this problem, and extend this algorithm to solve a group of proximity problems.

This work was supported in part by The Israel Science Foundation (grant #452/08), and by a Minerva grant.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, I., Bartal, Y., Neiman, O.: Local embeddings of metric spaces. In: Proceedings of 39th Annual ACM Symposium on Theory of Computing, pp. 631–640 (2007)

    Google Scholar 

  2. Abraham, I., Bartal, Y., Neiman, O.: Embedding metric spaces in their intrinsic dimension. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 363–372 (2008)

    Google Scholar 

  3. Ackermann, M.R., Blömer, J., Sohler, C.: Clustering for metric and non-metric distance measures. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 799–808 (2008)

    Google Scholar 

  4. Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th IEEE International Conference on Distributed Computing Systems, p. 75 (2006)

    Google Scholar 

  5. Assouad, P.: Plongements lipschitziens dans R n. Bull. Soc. Math. France 111(4), 429–448 (1983)

    MATH  MathSciNet  Google Scholar 

  6. Bartal, Y., Gottlieb, L., Kopelowitz, T., Lewenstein, M., Roditty, L.: Fast and precise distance queries (2010) (manuscript)

    Google Scholar 

  7. Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: 23rd International Conference on Machine Learning, pp. 97–104 (2006)

    Google Scholar 

  8. Bshouty, N.H., Li, Y., Long, P.M.: Using the doubling dimension to analyze the generalization of learning algorithms. Journal of Computer and System Sciences 75(6), 323–335 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bartal, Y., Recht, B., Schulman, L.: A Nash-type dimensionality reduction for discrete subsets of L 2. Manuscript (2007), http://www.ist.caltech.edu/~brecht/publications.html

  10. Chan, T.-H., Gupta, A.: Small hop-diameter sparse spanners for doubling metrics. In: 17th Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 70–78 (2006)

    Google Scholar 

  11. Cole, R., Gottlieb, L.: Searching dynamic point sets in spaces with bounded doubling dimension. In: 38th Annual ACM Symposium on Theory of Computing, pp. 574–583 (2006)

    Google Scholar 

  12. Chan, T.-H.H., Gupta, A.: Approximating tsp on metrics with bounded global growth. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 690–699 (2008)

    Google Scholar 

  13. Chan, H., Gupta, A., Talwar, K.: Ultra-low-dimensional embeddings for doubling metrics. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 333–342 (2008)

    Google Scholar 

  14. Clementi, A.E.F.: Improved non-approximability results for minimum vertex cover with density constraints. Theor. Comput. Sci. 225(1-2), 113–128 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  15. Damian, M., Pandit, S., Pemmaraju, S.V.: Distributed spanner construction in doubling metric spaces. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 157–171. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Friedler, S.A., Mount, D.M.: Approximation algorithm for the kinetic robust k-center problem. Comput. Geom. Theory Appl. 43(6-7), 572–586 (2010)

    MATH  MathSciNet  Google Scholar 

  17. Gao, J., Guibas, L.J., Nguyen, A.: Deformable spanners and applications. Comput. Geom. Theory Appl. 35(1), 2–19 (2006)

    MATH  MathSciNet  Google Scholar 

  18. Gionis, A., Hinneburg, A., Papadimitriou, S., Tsaparas, P.: Dimension induced clustering. In: KDD 2005: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 51–60 (2005)

    Google Scholar 

  19. Gottlieb, L., Krauthgamer, R.: A nonlinear approach to dimension reduction. In: CoRR, abs/0907.5477 (2009)

    Google Scholar 

  20. Gottlieb, L., Kontorovich, A., Krauthgamer, R.: Efficient classification for metric data. In: COLT (2010)

    Google Scholar 

  21. Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 534–543 (October 2003)

    Google Scholar 

  22. Gottlieb, L., Roditty, L.: Improved algorithms for fully dynamic geometric spanners and geometric routing. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 591–600 (2008)

    Google Scholar 

  23. Gottlieb, L., Roditty, L.: An optimal dynamic spanner for doubling metric spaces. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 478–489. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Hastad, J.: Clique is hard to approximate within n 1 − ε. Acta Mathematica, 627–636 (1996)

    Google Scholar 

  25. Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. In: 21st Annual Symposium on Computational Geometry, pp. 150–158. ACM, New York (2005)

    Google Scholar 

  26. Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM Journal on Computing 35(5), 1148–1184 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  27. Krauthgamer, R., Lee, J.R.: Navigating nets: Simple algorithms for proximity search. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 791–801 (January 2004)

    Google Scholar 

  28. Konjevod, G., Richa, A.W., Xia, D.: Dynamic routing and location services in metrics of low doubling dimension. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 379–393. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  29. Konjevod, G., Richa, A.W., Xia, D., Yu, H.: Compact routing with slack in low doubling dimension. In: 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 71–80. ACM, New York (2007)

    Google Scholar 

  30. Kleinberg, J.M., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 444–453 (2004)

    Google Scholar 

  31. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci. 43(3), 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  32. Slivkins, A.: Distance estimation and object location via rings of neighbors. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, pp. 41–50 (2005)

    Google Scholar 

  33. Talwar, K.: Bypassing the embedding: Algorithms for low dimensional metrics. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 281–290 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Weizmann Institute of Science, Rehovot, Israel

    Lee-Ad Gottlieb & Robert Krauthgamer

Authors
  1. Lee-Ad Gottlieb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Krauthgamer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politecnica de Catalunya, Departament de Llenguatges i Sistemes Informatics, Campus Nord - Ed Omega, Desp. 235, Jordi Girona, 1-3, 08034, Barcelona, Spain

    Maria Serna

  2. Department of Computer Science, University of Haifa, Mount Carmel, 31905, Haifa, Israel

    Ronen Shaltiel

  3. Department of Computer Science, University of Kiel, Olshausenstrasse 40, 24098, Kiel, Germany

    Klaus Jansen

  4. University of Geneva, Centre Universitaire d’Informatique, Battelle Bat. A, 7 rte de Drize, 1227, Carouge, Switzerland

    José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gottlieb, LA., Krauthgamer, R. (2010). Proximity Algorithms for Nearly-Doubling Spaces. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2010 2010. Lecture Notes in Computer Science, vol 6302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15369-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15369-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15368-6

  • Online ISBN: 978-3-642-15369-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation