Skip to main content
SpringerLink
Log in

Testing Euclidean Spanners

  • Chapter
Property Testing

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

Abstract

In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph is a (1 + δ)-spanner.

An extended version of this abstract will appear in the proceedings of the 18th European Symposium on Algorithms (ESA), 2010. This work was supported by DFG project SO 514/3-1.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of Clustering. SIAM Journal on Discrete Mathematics 16(3), 393–417 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahn, H.-K., Farshi, M., Knauer, C., Smid, M., Wang, Y.: Dilation-Optimal Edge Deletion in Polygonal Cycles. In: Algorithms and Computation, pp. 88–99. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient Testing of Large Graphs. Combinatorica 20(4), 451–476 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it’s all about regularity. SIAM Journal on Computing 39(1), 143–167 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Agarwal, P.K., Klein, R., Knauer, C., Langerman, S., Morin, P., Sharir, M., Soss, M.: Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discrete and Computational Geometry 39(1-3), 17–37 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Arya, S., Das, G., Mount, M., Salowe, J.S., Smid, M.: Euclidean spanners: short, thin, and lanky. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 489–498 (1995)

    Google Scholar 

  7. Avart, C., Rödl, V., Schacht, M.: Every Monotone 3-Graph Property is Testable. SIAM Journal on Discrete Mathematics 21(1), 73–92 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Batu, T., Fortnow, L., Fischer, E., Kumar, R., Rubinfeld, R., White, P.: Testing Random Variables for Independence and Identity. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 442–451 (2001)

    Google Scholar 

  9. Batu, T., Fortnow, L., Rubinfeld, R., Smith, W., White, P.: Testing that distributions are close. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 259–269 (2000)

    Google Scholar 

  10. Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 393–402 (2008)

    Google Scholar 

  11. Blais, E.: Testing juntas nearly optimally. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 151–158 (2009)

    Google Scholar 

  12. Blum, M., Luby, M., Rubinfeld, R.: Self-Testing/Correcting with Applications to Numerical Problems. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 73–83 (1990)

    Google Scholar 

  13. Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 291–300 (1993)

    Google Scholar 

  14. Chazelle, B., Liu, D., Magen, A.: Sublinear Geometric Algorithms. SIAM Journal on Computing 35(3), 627–646 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Clarkson, K.L.: Approximating algorithms for shortest path motion planning. In: Proceedings of the 19th ACM Symposium on the Theory of Computation, pp. 56–65 (1987)

    Google Scholar 

  16. Czumaj, A., Ergun, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., Sohler, C.: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing 35(1), 91–109 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Czumaj, A., Sohler, C.: Testing hypergraph colorability. Theoretical Computer Science 331(1), 37–52 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Czumaj, A., Shapira, A., Sohler, C.: Testing hereditary properties of non-expanding bounded-degree graphs. SIAM Journal on Computing 38(6), 2499–2510 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Czumaj, A., Sohler, C.: Property Testing with Geometric Queries. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 266–277. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  20. Czumaj, A., Sohler, C., Ziegler, M.: Property Testing in Computational Geometry. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 155–166. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Czumaj, A., Sohler, C.: Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms 4(3) (2008)

    Google Scholar 

  22. Ergun, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-Checkers. Journal of Computer and System Sciences 60(3), 717–751 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  23. Eppstein, D., Wortman, K.A.: Minimum dilation stars. Computational Geometry: Theory and Applications 37(1), 27–37 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  24. Farshi, M., Giannopoulos, P., Gudmundsson, J.: Finding the best shortcut in a geometric network. In: Proceedings of the 21th Annual Symposium on Computational Geometry, pp. 327–335 (2005)

    Google Scholar 

  25. Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 474–483 (2002)

    Google Scholar 

  26. Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing Monotonicity. Combinatorica 20(3), 301–337 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  27. Goldreich, O., Goldwasser, S., Ron, D.: Property Testing and its Connection to Learning and Approximation. Journal of the ACM 45(4), 653–750 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  28. Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. Algorithmica 32(2), 302–343 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  29. Keil, M.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208–213. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  30. Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 403–412 (2008)

    Google Scholar 

  31. Narasimhan, G., Smid, M.: Approximating the Stretch Factor of Euclidean Graphs. SIAM Journal on Computing, 978–989 (2000)

    Google Scholar 

  32. Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  33. Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures & Algorithms 20(2), 165–183 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  34. Rademacher, L., Vempala, S.: Testing Geometric Convexity. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 469–480. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  35. Rubinfeld, R., Sudan, M.: Robust Characterizations of Polynomials with Applications to Program Testing. SIAM Journal on Computing 25(2), 252–271 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technical University of Dortmund, 44227, Dortmund, Germany

    Frank Hellweg, Melanie Schmidt & Christian Sohler

Authors
  1. Frank Hellweg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Melanie Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Sohler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, 76100, Rehovot, Israel

    Oded Goldreich

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hellweg, F., Schmidt, M., Sohler, C. (2010). Testing Euclidean Spanners. In: Goldreich, O. (eds) Property Testing. Lecture Notes in Computer Science, vol 6390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16367-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16367-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16366-1

  • Online ISBN: 978-3-642-16367-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation