Skip to main content
SpringerLink
Log in

I/O-Efficiently Pruning Dense Spanners

  • Conference paper
Discrete and Computational Geometry (JCDCG 2004)

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

Included in the following conference series:

  • 896 Accesses

Abstract

Given a geometric graph G=(S,E) in \({\mathbb R}^{d}\) with constant dilation t, and a positive constant ε, we show how to construct a (1 + ε)-spanner of G with \({\mathcal O}(|S|)\) edges using \({\mathcal O}(sort(|E|))I/O\) I/O operations.

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. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  2. Althöfer, I., Das, G., Dobkin, D.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry 9, 81–100 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alzoubi, K.M., Li, X.-Y., Wang, Y., Wan, P.-J., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 14(4), 408–421 (2003)

    Article  Google Scholar 

  4. Arge, L.A.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–357. Kluwer, Dordrecht (2002)

    Google Scholar 

  5. Arge, L.A., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 685–694 (1998)

    Google Scholar 

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

    Google Scholar 

  7. Arya, S., Mount, D.M., Smid, M.: Randomized and deterministic algorithms for geometric spanners of small diameter. In: Proc. 35th IEEE Symposium on Foundations of Computer Science, pp. 703–712 (1994)

    Google Scholar 

  8. Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. Computational Geometry: Theory and Applications 28, 11–18 (2004)

    MATH  MathSciNet  Google Scholar 

  9. Buchsbaum, A.L., Westbrook, J.R.: Maintaining hierarchical graph views. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 566–575 (2000)

    Google Scholar 

  10. Callahan, P.B.: Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, Maryland (1995)

    Google Scholar 

  11. Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM 42, 67–90 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. International Journal of Computational Geometry and Applications 5, 124–144 (1995)

    MathSciNet  Google Scholar 

  13. Chen, D.Z., Das, G., Smid, M.: Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics 110, 151–167 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 139–149 (1995)

    Google Scholar 

  15. Das, G., Heffernan, P., Narasimhan, G.: Optimally sparse spanners in 3-dimensional Euclidean space. In: Proc. 9th Annual ACM Symposium on Computational Geometry, pp. 53–62 (1993)

    Google Scholar 

  16. Das, G., Narasimhan, G.: A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry & Applications 7, 297–315 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Das, G., Narasimhan, G., Salowe, J.: A new way to weigh malnourished Euclidean graphs. In: Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 215–222 (1995)

    Google Scholar 

  18. Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461. Elsevier Science Publishers, Amsterdam (2000)

    Chapter  Google Scholar 

  19. Eubank, S., Kumar, V.A., Marathe, M.V., Srinivasany, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: Munro, J.I. (ed.) Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 718–727 (2004)

    Google Scholar 

  20. Govindarajan, S., Lukovszki, T., Maheswari, A., Zeh, N.: I/O-efficient well-separated pair decomposition and its application. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 220–231. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Improved greedy algorithms for constructing sparse geometric spanners. SIAM Journal of Computing 31(5), 1479–1500 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  22. Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric graph. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 828–837 (2002)

    Google Scholar 

  23. Katriel, I., Meyer, U.: Elementary graph algorithms in external memory. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol. 2625, pp. 62–84. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Keil, J.M.: Approximating the complete Euclidean graph. In: Proc. 1st Scandinavian Workshop on Algorithmic Theory, pp. 208–213 (1988)

    Google Scholar 

  25. Levcopoulos, C., Narasimhan, G., Smid, M.: Improved algorithms for constructing fault-tolerant spanners. Algorithmica 32, 144–156 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  26. Li, X.-Y.: Applications of computational geometry in wireless ad hoc networks. In: Cheng, X.-Z., Huang, X., Du, D.-Z. (eds.) Ad Hoc wireless networking. Kluwer, Dordrecht (2003)

    Google Scholar 

  27. Lukovszki, T., Maheshwari, A., Zeh, N.: I/O-efficient batched range counting and its applications to proximity problems. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 244–255. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  28. Maheshwari, A., Smid, M., Zeh, N.: I/O-efficient shortest path queries in geometric spanners. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 287–299. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  29. Navarro, G., Paredes, R.: Practical construction of metric t-spanners. In: 5th Workshop on Algorithmic Engineering and Experiments, pp. 69–81. SIMA Press (2003)

    Google Scholar 

  30. Navarro, G., Paredes, R., Chávez, E.: t-spanners as a data structure for metric space searching. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 298–309. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  31. Salowe, J.S.: Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications 1, 99–107 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  32. Smid, M.: Closest point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 877–935. Elsevier Science Publishers, Amsterdam (2000)

    Chapter  Google Scholar 

  33. Toma, L.I., Zeh, N.: I/O-efficient algorithms for sparse graphs. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol. 2625, pp. 85–109. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  34. Vaidya, P.M.: A sparse graph almost as good as the complete graph on points in K dimensions. Discrete & Computational Geometry 6, 369–381 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  35. Vitter, J.S.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NICTA, Sydney, Australia

    Joachim Gudmundsson

  2. Institut für Informatik, Westfälische Wilhelms-Universität Münster, 48149, Münster, Germany

    Jan Vahrenhold

Authors
  1. Joachim Gudmundsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Vahrenhold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku Tokio, Japan

    Jin Akiyama

  2. Ibaraki University, Nakanarusawa, 316-8511, Hitachi, Ibaraki, Japan

    Mikio Kano

  3. Tokai University, 317 Nishino, 410-0395, Numazu, Japan

    Xuehou Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gudmundsson, J., Vahrenhold, J. (2005). I/O-Efficiently Pruning Dense Spanners. In: Akiyama, J., Kano, M., Tan, X. (eds) Discrete and Computational Geometry. JCDCG 2004. Lecture Notes in Computer Science, vol 3742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589440_11

Download citation

  • DOI: https://doi.org/10.1007/11589440_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30467-8

  • Online ISBN: 978-3-540-32089-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation